default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 123
Volume 123, November 2020
- Rania Boujemaa, Aida Jebali, Sondes Hammami
, Angel B. Ruiz:
Multi-period stochastic programming models for two-tiered emergency medical service system. 104974 - Luiz Henrique Barbosa, Eduardo Uchoa:
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection. 104986 - Mir Ehsan Hesam Sadati, Deniz Aksen, Necati Aras:
A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection. 104996 - Rainer Schlosser:
Risk-sensitive control of Markov decision processes: A moment-based approach with target distributions. 104997 - Enrico Angelelli, Claudia Archetti, Lorenzo Peirano:
A matheuristic for the air transportation freight forwarder service problem. 105002
- Sung Hoon Chung, Bhawesh Sah, Jinkun Lee:
Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions. 105004
- Ivan Vlasic, Marko Durasevic, Domagoj Jakobovic:
A comparative study of solution representations for the unrelated machines environment. 105005 - Alper Hamzadayi:
An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem. 105006 - Mao Chen, Xiangyang Tang, Ting Song, Chao Wu, Sanya Liu, Xicheng Peng:
A Tabu search algorithm with controlled randomization for constructing feasible university course timetables. 105007 - Bo Li, Qingkai Ji, Antonio Arreola-Risa:
Optimizing a production-inventory system under a cost target. 105015 - Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza:
Minimizing the total travel time with limited unfairness in traffic networks. 105016 - Maria Elena Bruni, Sara Khodaparasti, Erik Demeulemeester:
The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times. 105017 - Arthur Kramer, Mauro Dell'Amico, Dominique Feillet, Manuel Iori:
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. 105018 - Somayeh Torkaman, Mohammad Reza Akbari Jokar, Nevin Mutlu, Tom Van Woensel:
Solving a production-routing problem with price-dependent demand using an outer approximation method. 105019 - Willian T. Lunardi, Ernesto G. Birgin, Philippe Laborie, Débora P. Ronconi, Holger Voos:
Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. 105020 - Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio:
The stable set problem: Clique and nodal inequalities revisited. 105024 - Mageed Ghaleb, Hossein Zolfagharinia, Sharareh Taghipour:
Real-time production scheduling in the Industry-4.0 context: Addressing uncertainties in job arrivals and machine breakdowns. 105031 - Christopher Bayliss, Roberto Guidotti, Alejandro Estrada-Moreno, Guillermo Franco, Angel A. Juan:
A biased-randomized algorithm for optimizing efficiency in parametric earthquake (Re) insurance solutions. 105033 - Farouk Hammami, Monia Rekik, Leandro C. Coelho:
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem. 105034 - Dezhi Zhang, Wei Xu, Bin Ji, Shuangyan Li, Yajie Liu:
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem. 105035 - Max Åstrand, Mikael Johansson, Alessandro Zanarini:
Underground mine scheduling of mobile machines using Constraint Programming and Large Neighborhood Search. 105036
- Jianxin Chen, Tonghua Zhang, Yong-Wu Zhou, Yuanguang Zhong:
Joint decision of pricing and ordering in stochastic demand with Nash bargaining fairness. 105037 - Bo Yan, Xiaoxu Chen, Cong-Yan Cai, Shiyan Guan:
Supply chain coordination of fresh agricultural products based on consumer behavior. 105038
- Youcef Amarouche, Rym Nesrine Guibadj, Elhadja Chaalal, Aziz Moukrim:
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows. 105039 - Richard Martin Lusby, Mette Gamst, Stefan Ropke, Simon Spoorendonk:
Simultaneously exploiting two formulations: An exact benders decomposition approach. 105041 - Mustafa Avci, Seyda Topaloglu:
A mathematical programming-based heuristic for the production routing problem with transshipments. 105042 - Longlong Leng, Jingling Zhang, Chunmiao Zhang, Yanwei Zhao, Wanliang Wang, Gongfa Li:
Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects. 105043 - Bernard G. Zweers, Sandjai Bhulai, Rob D. van der Mei:
Pre-processing a container yard under limited available time. 105045 - K. J. C. Fransen, J. A. W. M. van Eekelen, Alexander Yu. Pogromsky, Marko A. A. Boon, Ivo J. B. F. Adan:
A dynamic path planning approach for dense, large, grid-based automated guided vehicle systems. 105046 - Mehdi Mahmoodjanloo, Reza Tavakkoli-Moghaddam, Armand Baboli, Atefeh Jamiri:
A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand. 105048 - Rafael Blanquero, Emilio Carrizosa, Asunción Jiménez-Cordero, Belén Martín-Barragán:
Selection of time instants and intervals with Support Vector Regression for multivariate functional data. 105050 - Line Eide, Gro Cesilie Håhjem Årdal, Nataliia Evsikova, Lars Magnus Hvattum, Sebastián Urrutia:
Load-dependent speed optimization in maritime inventory routing. 105051
- Asma-Qamaliah Abdul-Hamid, Mohd Helmi Ali, Ming-Lang Tseng, Shulin Lan, Mukesh Kumar:
Impeding challenges on industry 4.0 in circular economy: Palm oil industry in Malaysia. 105052
- Richard L. Church, Shaohua Wang:
Solving the p-median problem on regular and lattice networks. 105057
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.
last updated on 2024-11-08 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
