default search action
Computers & Operations Research, Volume 153
Volume 153, May 2023
- Jiajun Xu, Suvrajeet Sen:
Compromise policy for multi-stage stochastic linear programming: Variance and bias reduction. 106132 - Yuan-Yuan Liu, Kuo-Hao Chang, You-Ying Chen:
Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization. 106146 - I. Esra Büyüktahtakin:
Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems. 106149 - Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao:
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. 106151 - Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. 106153 - Livia Maria Pierini, Kelly Cristina Poldi:
Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries. 106157 - Gustavo Alencar Rolim, Marcelo Seido Nagano, Bruno de Athayde Prata:
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. 106159 - Alan T. Murray, Richard L. Church:
Spatial optimization of multiple area land acquisition. 106160 - Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende:
Efficient GRASP solution approach for the Prisoner Transportation Problem. 106161 - Xuyang Luo, Chunyue Song:
Optimal decision-making of mutual fund temporary borrowing problem via approximate dynamic programming. 106162 - Sina Akbari, Adolfo R. Escobedo:
Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems. 106164 - José Coelho, Mario Vanhoucke:
New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms. 106165 - Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu:
A parallel adaptive memory algorithm for the capacitated modular hub location problem. 106173 - Nicolas Cheimanoff, Pierre Féniès, Mohamed Nour Kitri, Nikolay Tchernev:
Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem. 106174 - Yun Hui Lin, Qingyun Tian, Shaojun Liu:
Service expansion for chained business facilities under congestion and market competition. 106175 - Fatemeh Mazdarani, Seyed Farid Ghannadpour, Fatemeh Zandieh:
Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation. 106177 - Filippo Pecci, Ivan Stoianov:
Bounds and convex heuristics for bi-objective optimal experiment design in water networks. 106181 - Cristobal Pais, Andrés Weintraub, Zuo-Jun Max Shen:
Stochastic forestry planning under market and growth uncertainty. 106182 - Shuang Zheng, Zhengwen He, Zhen Yang, Chengbin Chu, Nengmin Wang:
Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem. 106183 - Eliseu Junio Araújo, Maryam Darvish, Jacques Renaud:
The road train optimization problem with load assignment. 106184 - Yong Ma, Zhengwen He, Nengmin Wang, Erik Demeulemeester:
Tabu search for proactive project scheduling problem with flexible resources. 106185 - Jun Wu, Chu-Min Li, Luzhi Wang, Shuli Hu, Peng Zhao, Minghao Yin:
On solving simplified diversified top-k s-plex problem. 106187 - Bruno Salezze Vieira, Glaydston Mattos Ribeiro, Laura Bahiense:
Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem. 106189
- In-Jae Jeong:
A review of decentralized optimization focused on information flows of decomposition algorithms. 106190
- Hamzea Al-Jabouri, Ahmed Saif, Claver Diallo, Abdelhakim Khatab:
Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems. 106191
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.