default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 103
Volume 103, March 2019
- Dujuan Wang
, Jiaqi Zhu, Xiaowen Wei, T. C. E. Cheng, Yunqiang Yin, Yanzhang Wang:
Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. 1-12 - Diego Gabriel Rossit, Daniele Vigo, Fernando Tohmé, Mariano Frutos:
Visual attractiveness in routing problems: A review. 13-34 - Junwen Ding, Liji Shen, Zhipeng Lü, Bo Peng:
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. 35-45 - Gulcin Bektur, Tugba Saraç:
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. 46-63 - Martin Hughes, Marc Goerigk, Michael Wright:
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. 64-80 - Zhenzhen Zhang, Brenda Cheang, Chongshou Li, Andrew Lim:
Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. 81-96 - Eduardo Conde:
Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios. 97-108 - Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane:
A path-based solution approach for the Green Vehicle Routing Problem. 109-122 - Jeroen Burgelman, Mario Vanhoucke:
Computing project makespan distributions: Markovian PERT networks revisited. 123-133 - Alexander Biele, Lars Mönch:
Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines. 134-147 - Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
A parallel machine schedule updating game with compensations and clients averse to uncertain loss. 148-157 - Alessandro Galligari, Marco Sciandrone:
A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand. 158-166 - Oliver Strub, Norbert Trautmann:
A two-stage approach to the UCITS-constrained index-tracking problem. 167-183 - Pieter Leyman, Niels Van Driessche, Mario Vanhoucke, Patrick De Causmaecker:
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models. 184-197 - Ulrich Breunig, Roberto Baldacci, Richard F. Hartl, Thibaut Vidal:
The electric two-echelon vehicle routing problem. 198-210 - Claudio Contardo, Manuel Iori, Raphael Kramer:
A scalable exact algorithm for the vertex p-center problem. 211-220 - José Niño-Mora:
Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization. 221-236 - Armin Klausnitzer, Rainer Lasch:
Optimal facility layout and material handling network design. 237-251 - Tiziano Bacci, Sara Mattia, Paolo Ventura:
The bounded beam search algorithm for the block relocation problem. 252-264 - Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan:
Finding happiness: An analysis of the maximum happy vertices problem. 265-276 - Martin Bichler, Salman Fadaei, Dennis Kraft:
A simple and fast algorithm for convex decomposition in relax-and-round mechanisms. 277-287 - Rafael Kendy Arakaki, Fábio Luiz Usberti:
An efficiency-based path-scanning heuristic for the capacitated arc routing problem. 288-295 - Farzaneh Nasirian, Foad Mahdavi Pajouh, Josephine M. Namayanja:
Exact algorithms for the minimum cost vertex blocker clique problem. 296-309 - Karim Y. P. Martínez, Yossiri Adulyasak, Raf Jans, Reinaldo Morabito, Eli Angela V. Toso:
An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem. 310-323
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-10-31 20:03 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:
