default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 64
Volume 64, December 2015
- Claudia Archetti
, Nicola Bianchessi, M. Grazia Speranza:
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. 1-10 - Çagri Koç, Tolga Bektas, Ola Jabali, Gilbert Laporte:
A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. 11-27 - Yang-Kuei Lin, Hao-Chen Lin:
Bicriteria scheduling problem for unrelated parallel machines with release dates. 28-39 - Khalil Chebil, Mahdi Khemakhem:
A dynamic programming algorithm for the Knapsack Problem with Setup. 40-50 - Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
A leader-follower model for discrete competitive facility location. 51-59 - Francisco Javier Pulido, Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
Dimensionality reduction in multiobjective shortest path search. 60-70 - David Coudert, Alvinice Kodjo, Truong Khoa Phan:
Robust energy-aware routing with redundancy elimination. 71-85 - Victor Fernandez-Viagas, Jose M. Framiñan:
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness. 86-96 - Antonio Costa, Arianna Alfieri, Andrea Matta, Sergio Fichera:
A parallel tabu search for solving the primal buffer allocation problem in serial production systems. 97-112 - Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. 113-129 - Sukanto Mondal, Yves Lucet, Warren L. Hare:
Optimizing horizontal alignment of roads in a specified corridor. 130-138 - Burak Kocuk, I. Kuban Altinel, Necati Aras:
Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction. 139-158 - Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia:
On the hop-constrained survivable network design problem with reliable edges. 159-167 - Rasul Esmaeilbeigi, Bahman Naderi, Parisa Charkhgard:
The type E simple assembly line balancing problem: A mixed integer linear programming formulation. 168-177 - Borzou Rostami, Federico Malucelli:
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation. 178-188 - Michel Gendreau, Gianpaolo Ghiani, Emanuela Guerriero:
Time-dependent routing problems: A review. 189-197 - Can Akkan:
Improving schedule stability in single-machine rescheduling for new operation insertion. 198-209 - Nasrin Aliakbarian, Farzad Dehghanian, Majid Salari:
A bi-level programming model for protection of hierarchical facilities under imminent attacks. 210-224 - Leopoldo Eduardo Cárdenas-Barrón, José Luis González Velarde, Gerardo Treviño-Garza:
A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem. 225-232 - Ibrahim Kucukkoc, David Z. Zhang:
Balancing of parallel U-shaped assembly lines. 233-244 - Niraj Ramesh Dayama, Mohan Krishnamoorthy, Andreas T. Ernst, Narayan Rangaraj, Vishnu Narayanan:
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence. 245-261 - Pedro M. Castro, Inês Marques:
Operating room scheduling with Generalized Disjunctive Programming. 262-273 - Ahmad Hemmati, Magnus Stålhane, Lars Magnus Hvattum, Henrik Andersson:
An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. 274-282 - Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
A new heuristic for detecting non-Hamiltonicity in cubic graphs. 283-292 - Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn:
Infra-chromatic bound for exact maximum clique search. 293-303
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-12-22 19:04 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:
