default search action
Computers & Operations Research, Volume 78
Volume 78, February 2017
- David Canca
, Alicia De-Los-Santos, Gilbert Laporte, Juan A. Mesa:
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. 1-14 - Britta Schulze
Bi-dimensional knapsack problems with one soft constraint. 15-26 - Gabriel Gutiérrez-Jarpa
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. 27-43 - Thomas Breugem
Analysis of FPTASes for the multi-objective shortest path problem. 44-58 - Kittiwat Sirikasemsuk, Huynh Trung Luong:
Measure of bullwhip effect in supply chains with first-order bivariate vector autoregression time-series demand model. 59-79 - Una Benlic, Edmund K. Burke
Breakout local search for the multi-objective gate allocation problem. 80-93 - Qiuzhen Lin
A novel adaptive control strategy for decomposition-based multiobjective algorithm. 94-107 - Csaba Raduly-Baka, Mika Johnsson, Olli S. Nevalainen:
Tool-feeder partitions for module assignment in PCB assembly. 108-116 - José Elías C. Arroyo, Joseph Y.-T. Leung:
Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. 117-128 - Vinícius R. Máximo
Intelligent-guided adaptive search for the maximum covering location problem. 129-137 - Xuan Thanh Le, Sigrid Knust:
MIP-based approaches for robust storage loading problems with stacking constraints. 138-153 - Özgür Özpeynirci, Selin Özpeynirci
An interactive approach for multiple criteria selection problem. 154-162 - Francesco Carrabs
A novel discretization scheme for the close enough traveling salesman problem. 163-171 - Emir Demirovic, Nysret Musliu
MaxSAT-based large neighborhood search for high school timetabling. 172-180 - Jose M. Framiñan
New approximate algorithms for the customer order scheduling problem with total completion time objective. 181-192 - A. Rodríguez-Díaz, Belarmino Adenso-Díaz
Minimizing deviation from scheduled times in a single mixed-operation runway. 193-202 - Twan Dollevoet
Application of an iterative framework for real-time railway rescheduling. 203-217 - Boaz Golany, Noam Goldberg
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games. 218-229 - Martine Labbé
A comparative study of formulations and solution methods for the discrete ordered p-median problem. 230-242 - Francisco J. Rodríguez, Fred W. Glover, Carlos García-Martínez
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem. 243-254 - Junwen Ding, Zhipeng Lü, Taoqing Zhou, Liping Xu:
A quality and distance guided hybrid algorithm for the vertex separator problem. 255-266 - Faezeh Akhavizadegan, Javad Ansarifar, Fariborz Jolai
A novel approach to determine a tactical and operational decision for dynamic appointment scheduling at nuclear medical center. 267-277 - Ronan Bocquillon, Antoine Jouglet:
A constraint-programming-based approach for solving the data dissemination problem. 278-289 - Maxence Delorme
Logic based Benders' decomposition for orthogonal stock cutting problems. 290-298 - Juan A. Aledo
Partial evaluation in Rank Aggregation Problems. 299-304 - José Fernández
A planar single-facility competitive location and design problem under the multi-deterministic choice rule. 305-315 - Wei Li, Demetres D. Kouvatsos, Rod J. Fretwell:
On the analytic assessment of the impact of traffic correlation on queues in continuous time domain. 316-334 - Borja Ponte
Exploring the interaction of inventory policies across the supply chain: An agent-based approach. 335-348 - Roberto Aringhieri, Maria Elena Bruni
Emergency medical services and beyond: Addressing new challenges through a wide literature review. 349-368 - Emilio Carrizosa
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach. 369-380 - Jelke J. van Hoorn
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming. 381
- Abraham Duarte, Nenad Mladenovic
Special issue on Variable neighborhood search methods in business and engineering. 382-384 - Angelo Sifaleras
Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems. 385-392 - Chandra Ade Irawan
Bi-objective optimisation model for installation scheduling in offshore wind farms. 393-407 - Pamela J. Palomo-Martínez
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints. 408-419 - Omar Dib, Marie-Ange Manier, Laurent Moalic
Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks. 420-430 - Gilles Caporossi:
Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system. 431-438 - Erfan Hassannayebi
Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem. 439-453 - Naveed Wassan, Niaz A. Wassan, Gábor Nagy, Saïd Salhi
The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search. 454-467 - Raca Todosijevic
A general variable neighborhood search for the swap-body vehicle routing problem. 468-479 - Marcella Samà
A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations. 480-499 - Borja Menéndez
Variable Neighborhood Search strategies for the Order Batching Problem. 500-512 - Mouaouia Cherif Bouzid
An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. 513-525 - Belma Turan, Stefan Minner
A VNS approach to multi-location inventory redistribution with vehicle routing. 526-536 - Sanja Grohmann, Dragan Urosevic
Solving multifacility Huff location models on networks using metaheuristic and exact approaches. 537-546 - Luca Talarico, Johan Springael
A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem. 547-556 - Adil I. Erzin
Variable neighborhood search variants for Min-power symmetric connectivity problem. 557-563 - Zhengwen He, Hua He, Renjing Liu, Nengmin Wang:
Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap. 564-577 - Vitor Nazário Coelho, Thays A. Oliveira, Igor Machado Coelho, Bruno N. Coelho
Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. 578-587
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-03-08 00:37 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: