default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 76
Volume 76, December 2016
- Sameh Al-Shihabi
:
A hybrid of max-min ant system and linear programming for the k-covering problem. 1-11 - Mirsad Buljubasic, Michel Vasquez:
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. 12-21 - Mohamed El Khadiri, Wei-Chang Yeh:
An efficient alternative to the exact evaluation of the quickest path flow network reliability problem. 22-32 - Kum-Khiong Yang, Tugba Cayirli, Joyce Mei Wan Low:
Predicting the performance of queues-A data analytic approach. 33-42 - Amir Hossein Niknamfar, Seyed Taghi Akhavan Niaki:
Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: Binary-continuous differential evolution. 43-59 - Pieter Smet, Andreas T. Ernst, Greet Vanden Berghe:
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. 60-72 - Min Wen, E. Linde, Stefan Ropke, Pitu Mirchandani, Allan Larsen:
An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem. 73-83 - Juan-Pablo Riquelme-Rodríguez, Michel Gamache, André Langevin:
Location arc routing problem with inventory constraints. 84-94 - István Módos, Premysl Sucha, Roman Václavík, Jan Smejkal, Zdenek Hanzálek:
Adaptive online scheduling of tasks with anytime property on heterogeneous resources. 95-117 - Rejane Arinos Vasco, Reinaldo Morabito:
The dynamic vehicle allocation problem with application in trucking companies in Brazil. 118-133 - Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos:
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. 134-146 - G. D. H. Claassen, Johanna C. Gerdessen, Eligius M. T. Hendrix, Jack G. A. J. van der Vorst:
On production planning and scheduling in food processing industry: Modelling non-triangular setups andproduct decay. 147-154 - Pengyu Yan, Guanhua Wang, Ada Che, Yaoyiran Li:
Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance. 155-166 - Chien-Nan Yang, Bertrand M. T. Lin, F. J. Hwang, Meng-Chun Wang:
Acquisition planning and scheduling of computing resources. 167-182 - Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho:
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. 183-194 - Isabel Méndez-Díaz, Paula Zabala, Juan José Miranda Bront:
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. 195-207 - Ulrich Breunig, Verena Schmid, Richard F. Hartl, Thibaut Vidal:
A large neighbourhood based heuristic for two-echelon routing problems. 208-225 - Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan:
Time constrained maximal covering salesman problem with weighted demands and partial coverage. 226-237
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-02-26 20:35 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:
