default search action
OR Spectrum, Volume 43
Volume 43, Number 1, March 2021
- Nils Boysen, Stefan Fedtke, Stefan Schwerdfeger:
Last-mile delivery concepts: a survey from an operational research perspective. 1-58 - Ralf Krohn, Sven Müller, Knut Haase:
Preventive healthcare facility location planning with quality-conscious clients. 59-87 - Jens Van Engeland, Jeroen Beliën:
Tactical waste collection: column generation and mixed integer programming based heuristics. 89-126 - Qi Zhang, Shixin Liu, Ruiyou Zhang, Shujin Qin:
Column generation algorithms for mother plate design in steel plants. 127-153 - Nafiseh Shamsi Gamchi, S. Ali Torabi, Fariborz Jolai:
A novel vehicle routing problem for vaccine distribution using SIR epidemic model. 155-188 - Nils Knofius, M. C. van der Heijden, Andrei Sleptchenko, W. H. M. Zijm:
Improving effectiveness of spare parts supply by additive manufacturing as dual sourcing option. 189-221 - Ziwei Lin, Nicla Frigerio, Andrea Matta, Shichang Du:
Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems. 223-253 - Mehdi Toloo, Esmaeil Keshavarz, Adel Hatami-Marbini:
An interval efficiency analysis with dual-role factors. 255-287 - Lorena S. Reyes-Rubiano, Jana Voegl, Klaus-Dieter Rest, Javier Faulin, Patrick Hirsch:
Exploration of a disrupted road network after a disaster with an online routing algorithm. 289-326
Volume 43, Number 2, June 2021
- Maliheh Khorsi, Seyed Kamal Chaharsooghi, Ali Husseinzadeh Kashan, Ali Bozorgi-Amiri:
Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability. 327-365 - Stefano Coniglio, Mathias Sirvent, Martin Weibelzahl:
Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets. 367-408 - Cinna Seifi, Marco Schulze, Jürgen Zimmermann:
Solution procedures for block selection and sequencing in flat-bedded potash underground mines. 409-440 - Andreas Dellnitz, Elmar Reucher, Andreas Kleine:
Efficiency evaluation in data envelopment analysis using strong defining hyperplanes. 441-465 - Rosephine G. Rakotonirainy, Jan H. van Vuuren:
The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation. 467-495 - Markus Sinnl:
Mixed-integer programming approaches for the time-constrained maximal covering routing problem. 497-542 - Ana Paias, Marta Mesquita, Margarida Moz, Margarida Vaz Pato:
A network flow-based algorithm for bus driver rerostering. 543-576 - Pawel Jan Kalczynski, Zvi Drezner:
The obnoxious facilities planar p-median problem. 577-593 - Cinna Seifi, Marco Schulze, Jürgen Zimmermann:
Correction to: Solution procedures for block selection and sequencing in flat-bedded potash underground mines. 595 - Outstanding Reviewer Award OR Spectrum 2020. 597
- Acknowledgement to reviewers. 599-601
Volume 43, Number 3, September 2021
- Gianni A. Di Caro, Vittorio Maniezzo, Roberto Montemanni, Matteo Salani:
Machine learning and combinatorial optimization, editorial. 603-605 - Yuan Sun, Andreas T. Ernst, Xiaodong Li, Jake Weiner:
Generalization of machine learning for problem reduction: a case study on travelling salesman problems. 607-633 - Franco Peschiera, Robert Dell, Johannes O. Royset, Alain Haït, Nicolas Dupin, Olga Battaïa:
A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem. 635-664 - Adejuyigbe O. Fajemisin, Laura Climent, Steven D. Prestwich:
An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem. 665-692 - Nikolaus Furian, Michael J. O'Sullivan, Cameron G. Walker, Eranda Çela:
A machine learning-based branch and price algorithm for a sampled vehicle routing problem. 693-732 - Seyma Gozuyilmaz, O. Erhun Kundakcioglu:
Mathematical optimization for time series decomposition. 733-758 - Alicia Robles-Velasco, Pablo Cortés, Jesús Muñuzuri, Luis Onieva:
Estimation of a logistic regression model by a genetic algorithm to predict pipe failures in sewer networks. 759-776 - Jorge A. Sefair, Oscar O. Guaje, Andrés L. Medaglia:
A column-oriented optimization approach for the generation of correlated random vectors. 777-808 - Nathan Sudermann-Merx, Steffen Rebennack:
Leveraged least trimmed absolute deviations. 809-834
Volume 43, Number 4, December 2021
- Corinna Krebs, Jan Fabian Ehmke, Henriette Koch:
Advanced loading constraints for 3D vehicle routing problems. 835-875 - Christian Tilk, Katharina Olkis, Stefan Irnich:
The last-mile vehicle routing problem with delivery options. 877-904 - Sean Grogan, Robert Pellerin, Michel Gamache:
Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims. 905-939 - Juliette García-Alviz, Gina Galindo, Julián Arellana, Ruben Yie-Pinedo:
Planning road network restoration and relief distribution under heterogeneous road disruptions. 941-981 - Selin Özpeynirci, Özgür Özpeynirci, Vincent Mousseau:
An interactive algorithm for resource allocation with balance concerns. 983-1005 - Saeed Poormoaied, Ece Zeliha Demirci:
Analysis of an inventory system with emergency ordering option at the time of supply disruption. 1007-1045 - Amanda O. C. Ayres, Betania Silva Carneiro Campello, Washington A. Oliveira, Carla T. L. S. Ghidini:
A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems. 1047-1076 - Qingxian An, Ping Wang, Honglin Yang, Zongrun Wang:
Fixed cost allocation in two-stage system using DEA from a noncooperative view. 1077-1102 - Bohlool Ebrahimi, Madjid Tavana, Andreas Kleine, Andreas Dellnitz:
An epsilon-based data envelopment analysis approach for solving performance measurement problems with interval and ordinal dual-role factors. 1103-1124 - Xingli Wu, Huchang Liao:
Learning judgment benchmarks of customers from online reviews. 1125-1157
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.