Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 81
Volume 81, May 2017
- Mohamed Amine Masmoudi, Kris Braekers
, Malek Masmoudi, Abdelaziz Dammak:
A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem. 1-13 - Tatsushi Nishi, Akiyoshi Ohno, Masahiro Inuiguchi, Satoru Takahashi, Kenji Ueda:
A Combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints. 14-25 - Carlo Filippi, Renata Mansini, Elisa Stevanato:
Mixed integer linear programming models for optimal crop selection. 26-39 - Bruno Petrato Bruck, Valerio Incerti, Manuel Iori, Matteo Vignoli:
Minimizing CO2 emissions in a practical daily carpooling problem. 40-50 - Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade:
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. 51-66 - Antonio Frangioni, Laura Galli, Giovanni Stea:
Delay-constrained routing problems: Accurate scheduling models and admission control. 67-77 - Fuda Ma, Jin-Kao Hao, Yang Wang:
An effective iterated tabu search for the maximum bisection problem. 78-89 - Radoslaw Rudek:
Scheduling on parallel processors with varying processing times. 90-101 - Kagan Gokbayrak, E. Alper Yildirim:
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks. 102-118 - Nahid Jafari, Bryan L. Nuse, Clinton T. Moore, Bistra Dilkina, Jeffrey Hepinstall-Cymerman:
Achieving full connectivity of sites in the multiperiod reserve network design problem. 119-127 - Hatice Calik, Markus Leitner, Martin Luipersbeck:
A Benders decomposition based framework for solving cable trench problems. 128-140 - Hamed Samarghandi, Mehdi Behroozi:
On the exact solution of the no-wait flow shop problem with due date constraints. 141-159 - Jérémie Dubois-Lacoste, Federico Pagnozzi, Thomas Stützle:
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. 160-166 - Victor Fernandez-Viagas, Jose M. Framiñan:
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. 167-177 - Eduardo Álvarez-Miranda, Jordi Pereira:
Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. 178-191 - Paulo Vitor Silvestrin, Marcus Ritt:
An iterated tabu search for the multi-compartment vehicle routing problem. 192-202 - Bruno Ferreira Rosa, Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza, Moacir Felizardo de França Filho, Zacharie Alès, Philippe Yves Paul Michelon:
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. 203-215 - Patrick Meyer, Alexandru-Liviu Olteanu:
Integrating large positive and negative performance differences into multicriteria majority-rule sorting models. 216-230 - Stefano Sebastio, Giorgio Gnecco, Alberto Bemporad:
Optimal distributed task scheduling in volunteer clouds. 231-246 - Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González:
An exact algorithm for a Vehicle-and-Driver Scheduling Problem. 247-256 - Luis Gouveia, Luidi Simonetti:
Spanning trees with a constraint on the number of leaves. A new formulation. 257-268 - Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni:
The probabilistic orienteering problem. 269-281 - Sadeque Hamdan, Ali Cheaitou:
Supplier selection and order allocation with green criteria: An MCDM and multi-objective optimization approach. 282-304 - Hung-Hsin Chen, Chang-Biau Yang:
Multiperiod portfolio investment using stochastic programming with conditional value at risk. 305-321 - Selene Silvestri, Gilbert Laporte, Raffaele Cerulli:
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. 322-332
a service of 
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-07-02 21:29 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:
