default search action
Computers & Operations Research, Volume 145
Volume 145, September 2022
- Andrea Di Placido, Claudia Archetti, Carmine Cerrone:
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. 105831 - Ilia A. Tarasov, Alain Haït, Olga Battaïa:
Erratum to "Benders decomposition for a period-aggregated resource leveling problem with variable job duration" [Comput. Oper. Res. 132 (2021) 105258]. 105839 - Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza:
Optimal area polygonization problems: Exact solutions through geometric duality. 105842 - Debdatta Sinha Roy, Christof Defryn, Bruce L. Golden, Edward A. Wasil:
Data-driven optimization and statistical modeling to improve meter reading for utility companies. 105844 - Maria Elena Bruni, Sara Khodaparasti, Mohammad Moshref-Javadi:
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones. 105845 - Michele Monaci, Ciara Pike-Burke, Alberto Santini:
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. 105848 - Shijin Wang, Ying Lu, Feng Chu, Jianbo Yu:
Scheduling with divisible jobs and subcontracting option. 105850 - Nader Ghaffari-Nasab:
Stochastic hub location problems with Bernoulli demands. 105851 - Richard Allmendinger, Andrzej Jaszkiewicz, Arnaud Liefooghe, Christiane Tammer:
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization. 105857 - Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí:
Scatter search for the minimum leaf spanning tree problem. 105858 - Bianca Pascariu, Marcella Sama, Paola Pellegrini, Andrea D'Ariano, Joaquin Rodriguez, Dario Pacciarelli:
Effective train routing selection for real-time traffic management: Improved model and ACO parallel computing. 105859 - Zhineng Hu, Li Wang, Jindong Qin, Benjamin Lev, Lu Gan:
Optimization of facility location and size problem based on bi-level multi-objective programming. 105860 - Luis Augusto San-José, Joaquín Sicilia, Valentín Pando, David Alcaide López de Pablo:
An inventory system with time-dependent demand and partial backordering under return on inventory investment maximization. 105861 - Zilong Zhuang, Zhanluo Zhang, Hao Teng, Wei Qin, Huaijin Fang:
Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals. 105863 - Eun-Seok Kim, Ik Sun Lee:
Scheduling of two-machine flowshop with outsourcing lead-time. 105864 - Hernán Lespay, Karol Suchan:
Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. 105866 - Asma Ben-Said, Aziz Moukrim, Rym Nesrine Guibadj, Jérôme Verny:
Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows. 105867 - Sicheng Zhang, Xiyuan Zhao, Xiang Li, Haitao Yu:
Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging. 105868 - Edward Lam, Guy Desaulniers, Peter J. Stuckey:
Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations. 105870 - Sanne Wøhlk, Gilbert Laporte:
Transport of skips between recycling centers and treatment facilities. 105879 - Bruno de Athayde Prata, Victor Fernandez-Viagas, Jose M. Framiñan, Carlos Diego Rodrigues:
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. 105880 - Erdi Dasdemir, Rajan Batta, Murat Köksalan, Diclehan Tezcaner Öztürk:
UAV routing for reconnaissance mission: A multi-objective orienteering problem with time-dependent prizes and multiple connections. 105882
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.