default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 77
Volume 77, January 2017
- Yang Wang, Abraham P. Punnen:
The boolean quadratic programming problem with generalized upper bound constraints. 1-10 - Eduardo Conde
:
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions. 11-19 - Mari Jevne Arnesen, Magnhild Gjestvang, Xin Wang, Kjetil Fagerholt, Kristian Thun, Jørgen Glomvik Rakke:
A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping. 20-31 - Gültekin Kuyzu:
Lane covering with partner bounds in collaborative truckload transportation procurement. 32-43 - Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Vikas Goel, Yufen Shao:
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. 44-57 - Yves Molenbruch, Kris Braekers, An Caris, Greet Vanden Berghe:
Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. 58-71 - Neda Karimi, Hamid Davoudpour:
A knowledge-based approach for multi-factory production systems. 72-85 - Christian Fikar, Patrick Hirsch:
Home health care routing and scheduling: A review. 86-95 - Victor Fernandez-Viagas, Jose M. Framiñan:
Reduction of permutation flowshop problems to single machine problems using machine dominance relations. 96-110 - Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-Ke Pan, Ponnuthurai N. Suganthan:
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. 111-126 - Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
The pickup and delivery problem with time windows and handling operations. 127-140 - Xiangyong Li, Kai Wei, Yash P. Aneja, Peng Tian, Youzhi Cui:
Matheuristics for the single-path design-balanced service network design problem. 141-153 - Omid Shahvari, Rasaratnam Logendran:
An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. 154-176 - Wim van Ackooij, V. Berge, Welington de Oliveira, Claudia A. Sagastizábal:
Probabilistic optimization via approximate p-efficient points and bundle methods. 177-193 - Ankur Sinha, Pekka Malo, Kalyanmoy Deb:
Approximated set-valued mapping approach for handling multiobjective bilevel problems. 194-209 - Sandeep Srivathsan, Manjunath Kamath:
Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing. 210-225 - Yuning Chen, Jin-Kao Hao:
An iterated "hyperplane exploration" approach for the quadratic knapsack problem. 226-239 - Sebastian Koch:
Least squares approximate policy iteration for learning bid prices in choice-based revenue management. 240-253 - Yousef Maknoon, Gilbert Laporte:
Vehicle routing with cross-dock selection. 254-266 - Peter Buchholz, Iryna Dohndorf, Dimitri Scheftelowitsch:
Optimal decisions for continuous time Markov decision processes over finite planning horizons. 267-278
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 2025-08-25 22:50 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:
