Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 43
Volume 43, March 2014
- Yu-Jun Zheng
, Hai-Feng Ling, Haihe Shi, Hai-Song Chen, Sheng-Yong Chen:
Emergency railway wagon scheduling by hybrid biogeography-based optimization. 1-8 - Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. 9-19 - John Larusic, Abraham P. Punnen:
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis. 20-35 - Matias Sørensen, Florian H. W. Dahms:
A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark. 36-49 - Juanjo Peiró, Angel Corberán, Rafael Martí:
GRASP for the uncapacitated r-allocation p-hub median problem. 50-60 - María-Salomé Hernández-García, Juan José Salazar González:
Enhanced controlled tabular adjustment. 61-67 - Anthony Chen, Seungkyu Ryu, Xiangdong Xu, Keechoo Choi:
Computation and application of the paired combinatorial logit stochastic user equilibrium problem. 68-77 - Tugba Saraç, Aydin Sipahioglu:
Generalized quadratic multiple knapsack problem and two solution approaches. 78-89 - Teodor Gabriel Crainic, Mike Hewitt, Walter Rei:
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. 90-99 - Ignacio Araya, María Cristina Riff:
A beam search approach to the container loading problem. 100-107 - Cristiano Cervellera, Mauro Gaggero, Danilo Macciò:
Low-discrepancy sampling for approximate dynamic programming with local approximators. 108-115 - Marco A. Boschetti, Matteo Golfarelli, Stefano Rizzi, Elisa Turricchia:
A Lagrangian heuristic for sprint planning in agile software development. 116-128 - Remy Spliet, Adriana F. Gabor, Rommert Dekker:
The vehicle rescheduling problem. 129-136 - Xiaoyi Zhang, Zheng Zheng, Yueni Zhu, Kai-Yuan Cai:
Protection issues for supply systems involving random attacks. 137-156 - K. Wang, S. H. Choi:
A holonic approach to flexible flow shop scheduling under stochastic processing times. 157-168 - Marco Locatelli, Mirko Maischberger, Fabio Schoen:
Differential evolution methods based on local searches. 169-180 - Che Soong Kim, Valentina I. Klimenok, Alexander N. Dudin:
Analysis and optimization of Guard Channel Policy in cellular mobile networks with account of retrials. 181-190 - Joe Naoum-Sawaya:
Recursive central rounding for mixed integer programs. 191-200 - Oliver Sinnen:
Reducing the solution space of optimal task scheduling. 201-214 - Jiping Tao:
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time. 215-224 - Md. Fazle Baki, Ben A. Chaouch, Walid Abdul-Kader:
A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery. 225-236 - Yingying Kang, Rajan Batta, Changhyun Kwon:
Generalized route planning model for hazardous material transportation with VaR and equity considerations. 237-247 - Lanah Evers, Kristiaan Glorie, Suzanne van der Ster, Ana Isabel Barros, Herman Monsuur:
A two-stage approach to the orienteering problem with stochastic weights. 248-260 - Mario Ventresca, Dionne M. Aleman:
A derandomized approximation algorithm for the critical node detection problem. 261-270 - Peter T. Vanberkel, Richard J. Boucherie, Erwin W. Hans, Johann L. Hurink:
Optimizing the strategic patient mix combining queueing theory and dynamic programming. 271-279 - Stefano Benati, Sergio García:
A mixed integer linear model for clustering with variable selection. 280-285 - Mohamed Saifullah Hussin, Thomas Stützle:
Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances. 286-291 - Ji-Bo Wang, Jian-Jun Wang:
Flowshop scheduling with a general exponential learning effect. 292-308 - Rui Borges Lopes, Frank Plastria, Carlos Ferreira, Beatriz Sousa Santos:
Location-arc routing problem: Heuristic approaches and test instances. 309-317 - Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez:
A memetic algorithm for the Minimum Sum Coloring Problem. 318-327 - Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
A nested heuristic for parameter tuning in Support Vector Machines. 328-334 - Reza Faturechi, Eyal Levenberg, Elise Miller-Hooks:
Evaluating and optimizing resilience of airport pavement networks. 335-348
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-04-18 20:20 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:
