Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 109
Volume 109, September 2019
- Jeffrey E. Schaller, Jorge M. S. Valente
:
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. 1-11 - Everton Fernandes da Silva, Túlio Ângelo Machado Toffolo, Tony Wauters:
Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems. 12-27
- Guilherme Dhein, Marcelo Serrano Zanetti, Olinto César Bassi de Araújo, Ghendy Cardoso:
Minimizing dispersion in multiple drone routing. 28-42
- Juho Andelmin, Enrico Bartolini:
A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. 43-63 - M. A. Hakim Newton, Vahid Riahi, Kaile Su, Abdul Sattar:
Scheduling blocking flowshops with setup times via constraint guided and accelerated local search. 64-76 - Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. 77-88 - A. Cem Randa, Mustafa K. Dogru, Cem Iyigun, Ulas Özen:
Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy. 89-101 - Marcello Braglia, Davide Castellano, Leonardo Marrazzini, Dongping Song:
A continuous review, (Q, r) inventory model for a deteriorating item with random demand and positive lead time. 102-121 - Lars Dahle, Henrik Andersson, Marielle Christiansen, M. Grazia Speranza:
The pickup and delivery problem with time windows and occasional drivers. 122-133
- Daniel Schermer, Mahdi Moeini, Oliver Wendt:
A hybrid VNS/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. 134-158
- Sue-Jeong Kwon, Seulgi Joung, Kyungsik Lee:
Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem. 159-169 - Francisco López-Ramos, Stefano Nasini, Armando Guarnaschelli:
Road network pricing and design for ordinary and hazmat vehicles: Integrated model and specialized local search. 170-187 - Shijin Wang, Ying Lu:
A branch and price algorithm for single-machine completion time variance. 188-199 - Luis Augusto San-José, Joaquín Sicilia, Manuel González-de La Rosa, Jaime Febles-Acosta:
Analysis of an inventory system with discrete scheduling period, time-dependent demand and backlogged shortages. 200-208 - Daniele Catanzaro, Raffaele Pesenti:
Enumerating vertices of the balanced minimum evolution polytope. 209-217 - Ning Ma, Ya Liu, Zhili Zhou:
Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost. 218-229 - Mario Vanhoucke, José Coelho:
Resource-constrained project scheduling with activity splitting and setup times. 230-249 - Luisa Carpente, Ana Cerdeira-Pena, Silvia Lorenzo-Freire, Ángeles Saavedra Places:
Optimization in Sanger sequencing. 250-262 - Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo:
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. 263-272 - Su Nguyen, Dhananjay R. Thiruvady, Andreas T. Ernst, Damminda Alahakoon:
A hybrid differential evolution algorithm with column generation for resource constrained job scheduling. 273-287 - Mouna Kchaou Boujelben, Céline Gicquel:
Efficient solution approaches for locating electric vehicle fast charging stations under driving range uncertainty. 288-299 - Massimiliano Kaucic:
Equity portfolio management with cardinality constraints and risk parity control using multi-objective particle swarm optimization. 300-316
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-06-19 21: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:
