default search action
Computers & Operations Research, Volume 142
Volume 142, June 2022
- Justo Puerto, Federica Ricca, Moisés Rodríguez-Madrena, Andrea Scozzari:
A combinatorial optimization approach to scenario filtering in portfolio selection. 105701 - Sudarshan Rajan, Kaarthik Sundar, Natarajan Gautam:
Routing Problem for Unmanned Aerial Vehicle Patrolling Missions - A Progressive Hedging Algorithm. 105702 - Selin Özpeynirci, Özgür Özpeynirci, Vincent Mousseau:
Portfolio decision analysis with a generalized balance approach. 105705 - Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. 105715 - Niels-Christian Fink Bagger, Evelien van der Hurk, Rowan Hoogervorst, David Pisinger:
Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes. 105718 - Edwin Reynolds, Stephen J. Maher:
A data-driven, variable-speed model for the train timetable rescheduling problem. 105719 - Anis Kadri, Oumar Koné, Bernard Gendron:
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements. 105720 - Stephanie Allen, Steven A. Gabriel, John P. Dickerson:
Using inverse optimization to learn cost functions in generalized Nash games. 105721 - Alberto Santini, Ana Viana, Xenia Klimentova, João Pedro Pedroso:
The Probabilistic Travelling Salesman Problem with Crowdsourcing. 105722 - Mohammad Asghari, Seyed Mohammad Javad Mirzapour Al-e-hashem, Yacine Rekik:
Environmental and social implications of incorporating carpooling service on a customized bus system. 105724 - Razieh Mousavi, Mahdi Bashiri, Erfaneh Nikzad:
Stochastic production routing problem for perishable products: Modeling and a solution algorithm. 105725 - Pengfei He, Jin-Kao Hao:
Hybrid search with neighborhood reduction for the multiple traveling salesman problem. 105726 - Mostafa Khorramizadeh, Mohammad Sadegh Shiri:
Integer programming formulation and polyhedral results for windy collaborative arc routing problem. 105727 - Bahman Naderi, Mehmet A. Begen, Gregory S. Zaric:
Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms. 105728 - Miquel Bofill, Jordi Coll, Gerard Martín, Josep Suy, Mateu Villaret:
The Sample Analysis Machine Scheduling Problem: Definition and comparison of exact solving approaches. 105730
- Hegen Xiong, Shuangyuan Shi, Danni Ren, Jinjin Hu:
A survey of job shop scheduling problem: The types and models. 105731
- Korhan Karabulut, Hande Öztop, Damla Kizilay, Mehmet Fatih Tasgetiren, Levent Kandiller:
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. 105733 - Enrico Bettiol, Immanuel M. Bomze, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi:
Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems. 105735 - Cheng Guo, Merve Bodur, Dimitri J. Papageorgiou:
Generation expansion planning with revenue adequacy constraints. 105736 - Gert-Jaap Polinder, Valentina Cacchiani, Marie Schmidt, Dennis Huisman:
An iterative heuristic for passenger-centric train timetabling with integrated adaption times. 105740 - Artem Fomin, Boris Goldengorin:
An exact algorithm for the preemptive single machine scheduling of equal-length jobs. 105742 - Levi Ribeiro de Abreu, Bruno A. Prata, Jose M. Framiñan, Marcelo Seido Nagano:
New efficient heuristics for scheduling open shops with makespan minimization. 105744 - Christian Leonardo Camacho-Villalón, Marco Dorigo, Thomas Stützle:
An analysis of why cuckoo search does not bring any novel ideas to optimization. 105747 - Olcay Polat, Can Berk Kalayci, Duygu Topaloglu:
Modelling and solving the milk collection problem with realistic constraints. 105759
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.