default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 111
Volume 111, November 2019
- Yanchao Liu
:
An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones. 1-20
- Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou:
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing. 21-34 - Peihai Liu, Manzhan Gu, Ganggang Li:
Two-agent scheduling on a single machine with release dates. 35-42 - Zhi Lu, Jin-Kao Hao, Yi Zhou:
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. 43-57 - Lu Chen, Yang Liu, André Langevin:
A multi-compartment vehicle routing problem in cold-chain distribution. 58-66 - Sainan Wang, Suixiang Gao, Tunzi Tan, Wenguo Yang:
Bunker fuel cost and freight revenue optimization for a single liner shipping service. 67-83 - Guansheng Peng, Reginald Dewil, Cédric Verbeeck, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen:
Agile earth observation satellite scheduling: An orienteering problem with time-dependent profits and travel times. 84-98 - Georgios Dagkakis, Anna Rotondo, Cathal Heavey:
Embedding optimization with deterministic discrete event simulation for assignment of cross-trained operators: An assembly line case study. 99-115 - Ali Haydar Özer:
A double auction based mathematical market model and heuristics for internet-based secondhand durable good markets. 116-129 - Ali Ekici, Milad Elyasi, Okan Örsan Özener, Merve Burcu Sarikaya:
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics. 130-140 - Do Yeon Lee, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives. 141-154
- Cihan Tugrul Cicek, Hakan Gultekin, Bülent Tavli:
The location-allocation problem of drone base stations. 155-176
- Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Metaheuristic algorithms for the hybrid flowshop scheduling problem. 177-196 - Manuel Lozano, Humberto M. Trujillo:
Optimizing node infiltrations in complex networks by a local search based heuristic. 197-213 - Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel:
Assignment problem with conflicts. 214-229 - Pablo Cristini Guedes, Denis Borenstein, Monize Sâmara Visentini, Olinto César Bassi de Araújo, Alberto Francisco Kummer Neto:
Vehicle scheduling problem with loss in bus ridership. 230-242 - Omar Foutlane, Issmail El Hallaoui, Pierre Hansen:
Integral simplex using double decomposition for set partitioning problems. 243-257 - Maria Teresa Almeida, Raul Brás:
The maximum l-triangle k-club problem: Complexity, properties, and algorithms. 258-270 - Sanne Wøhlk, Gilbert Laporte:
A districting-based heuristic for the coordinated capacitated arc routing problem. 271-284 - Thomas Borthen, Henrik Loennechen, Kjetil Fagerholt, Xin Wang, Thibaut Vidal:
Bi-objective offshore supply vessel planning with costs and persistence objectives. 285-296 - Matthieu Gruson, Majid Bazrafshan, Jean-François Cordeau, Raf Jans:
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. 297-310 - Carlos Armando Zetina, Iván A. Contreras, Jean-François Cordeau:
Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design. 311-324 - Santiago Sánchez-Herrera, Jairo R. Montoya-Torres, Elyn L. Solano-Charris:
Flow shop scheduling problem with position-dependent processing times. 325-345 - Ana Flávia Uzeda dos Santos Macambira, Luidi Simonetti, Hugo Barbalho, Pedro Henrique González, Nelson Maculan:
A new formulation for the Safe Set problem on graphs. 346-356 - Amin Mallek, Mohamed Bendraouche, Mourad Boudhar:
Scheduling identical jobs on uniform machines with a conflict graph. 357-366 - Mualla Gonca Avci, Mustafa Avci:
An adaptive large neighborhood search approach for multiple traveling repairman problem with profits. 367-385 - Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi:
The clustered team orienteering problem. 386-399 - Mostafa Khatami, Amir Salehipour, F. J. Hwang:
Makespan minimization for the m-machine ordered flow shop scheduling problem. 400-414 - Eva Vallada, Fulgencia Villa, Luis Fanjul-Peyro:
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem. 415-424
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 2026-05-04 23:17 CEST 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:
