default search action
Computers & Operations Research, Volume 162
Volume 162, February 2024
- Moacyr Carlos Possan Junior, Adalberto Sato Michels, Leandro Magatão:
An exact constraint programming based procedure for the multi-manned assembly line balancing problem. 106451 - Faisal Alkaabneh:
Matheuristic for synchronized vehicle routing problem with multiple constraints and variable service time: Managing a fleet of sprayers and a tender tanker. 106454 - Sasan Mahmoudinazlou, Changhyun Kwon:
A hybrid genetic algorithm for the min-max Multiple Traveling Salesman Problem. 106455 - Shaban Usman, Cong Lu:
Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm. 106456 - Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei:
An asynchronous parallel benders decomposition method for stochastic network design problems. 106459
- Ramón Piedra-de-la-Cuadra, Francisco A. Ortega:
Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks. 106460
- Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa:
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. 106467 - Juan Francisco Correcher, Federico Perea, Ramón Alvarez-Valdés:
The berth allocation and quay crane assignment problem with crane travel and setup times. 106468 - Xudong Diao, Meng Qiu, Gangyan Xu:
Electric vehicle-based express service network design with recharging management: A branch-and-price approach. 106469 - Danny Blom, Christopher Hojny, Bart Smeulders:
Cutting Plane Approaches for the Robust Kidney Exchange Problem. 106470 - Anqi Li, Congying Han, Tiande Guo, Bonan Li:
Generating linear programming instances with controllable rank and condition number. 106471 - Guo Xinghai, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu:
Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control. 106472 - Radoslaw Puka, Iwona Skalna, Jerzy Duda, Adam Stawowy:
Deterministic constructive vN-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion. 106473 - Kanxin Hu, Yuxin Che, Tsan Sheng Ng, Jie Deng:
Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints. 106474 - Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie:
Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers. 106475 - Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu:
An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry. 106476 - Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White:
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis. 106477 - William N. Caballero, José Manuel Camacho, Tahir Ekin, Roi Naveiro:
Manipulating hidden-Markov-model inferences by corrupting batch data. 106478 - Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao:
Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method. 106479 - Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. 106482 - Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, Hamid R. Tizhoosh:
Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images. 106483
- Víctor Blanco, Alfredo Marín, Justo Puerto:
Intra-facility equity in discrete and continuous p-facility location problems. 106487
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.