default search action
Computers & Operations Research, Volume 166
Volume 166, 2024
- Hua Wang, Chunguang Bai, Benjamin Lev, Wei Chen:
Quick response under strategic consumers with high-price and stockout regrets. 106590 - Kenza Alioui, Karim Amrouche, Mourad Boudhar:
Reentrant open shop scheduling problem with time lags and no-wait constraints. 106595 - Harry Aguilar, Alberto García-Villoria, Rafael Pastor:
Heuristic and metaheuristic procedures for the Parallel Assembly Lines Balancing Problem with multi-line workstations and buffer sizing. 106596 - Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà:
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. 106597 - Kaan Pekel, Yilmazcan Özyurt, Baris Yildiz, Ali K. Dogru:
A branch-and-cut approach to solve the Fault Diagnosis Problem with Lazy Spread and imperfect system information. 106598 - Tamara Bigler:
A matheuristic for locating obnoxious facilities. 106602 - Bo Peng, Lunwen Wu, Rafael Martí, Jiangshui Ma:
A fast path relinking algorithm for the min-max edge crossing problem. 106603 - Hanna Furmanczyk, Tytus Pikies, Inka Sokolowska, Krzysztof Turowski:
Approximation algorithms for job scheduling with block-type conflict graphs. 106606 - Ada Che, Jing Li, Feng Chu, Chengbin Chu:
Optimizing emergency supply pre-positioning for disaster relief: A two-stage distributionally robust approach. 106607 - Marc Goerigk, Mohammad Khosravi:
Benchmarking problems for robust discrete optimization. 106608 - Eduardo A. Alarcón Gerbier, Udo Buscher:
The dynamic facility location problem with mobile production units: A waste recycling application. 106609 - Baruch Mor, Gur Mosheiov:
Due-Date assignment with acceptable lead-times on parallel machines. 106617 - Laio Oriel Seman, Cezar Antônio Rigo, Eduardo Camponogara, Eduardo Augusto Bezerra:
Benders decomposition for the energy aware task scheduling of constellations of nanosatellites. 106618 - Nazanin Nezami, Hadis Anahideh:
Dynamic Exploration-Exploitation Pareto Approach for high-dimensional expensive black-box optimization. 106619 - Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra:
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. 106620 - Xiaoyang Zhou, Tingting Guo, Shouyang Wang, Benjamin Lev, Zhe Zhang:
Drone-based hybrid charging for multiple sensors: A distributionally robust optimization approach. 106621 - Xue Li, Zhengwen He, Nengmin Wang:
A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective. 106623 - Baofeng Tian, Jingwen Zhang, Erik Demeulemeester, Hao Liu:
A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply. 106624 - Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero:
Real-time schedule adjustments for conflict-free vehicle routing. 106625 - Amélie Lambert:
A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem. 106626 - Chang Lv, Qiong Liu, Chaoyong Zhang, Yaping Ren, Hao Zhou:
A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem. 106627 - Alfredo Oneto, Álvaro Lorca, Elisa Ferrario, Alan Poulos, Juan Carlos de la Llera, Matías Negrete-Pincetic:
Data-driven optimization for seismic-resilient power network planning. 106628 - Enhao Liu, Tengmu Hu, Theodore T. Allen, Christoph Hermes:
Optimal classification trees with leaf-branch and binary constraints. 106629 - David Canca, Eva Barrena, Gilbert Laporte:
Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem. 106632 - Celia Jiménez-Piqueras, Consuelo Parreño-Torres, Ramón Alvarez-Valdés, Rubén Ruiz:
The container premarshalling problem under limited crane time: A constraint programming approach. 106635 - Mao Chen, Yajing Yang, Zeyu Zeng, Xiangyang Tang, Xicheng Peng, Sannuya Liu:
A filtered beam search based heuristic algorithm for packing unit circles into a circular container. 106636
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.