- Christophe Duhamel
, Philippe Lacomme
, Caroline Prodhon:
Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4): 723-739 (2011) - Christophe Duhamel
, Philippe Lacomme
, Alain Quilliot, Hélène Toussaint:
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3): 617-640 (2011) - Eugene Edison, Tal Shima:
Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms. Comput. Oper. Res. 38(1): 340-356 (2011) - Saber M. Elsayed
, Ruhul A. Sarker
, Daryl Leslie Essam
:
Multi-operator based evolutionary algorithms for solving constrained optimization problems. Comput. Oper. Res. 38(12): 1877-1896 (2011) - Marina A. Epelman
, Archis Ghate, Robert L. Smith:
Sampled fictitious play for approximate dynamic programming. Comput. Oper. Res. 38(12): 1705-1718 (2011) - Andreas T. Ernst
, Elena O. Gavriliouk, Leorey O. Marquez
:
An efficient Lagrangean heuristic for rental vehicle scheduling. Comput. Oper. Res. 38(1): 216-226 (2011) - Inmaculada Espejo
, Antonio M. Rodríguez-Chía
:
Simultaneous location of a service facility and a rapid transit line. Comput. Oper. Res. 38(2): 525-538 (2011) - Luis Fanjul-Peyro
, Rubén Ruiz
:
Size-reduction heuristics for the unrelated parallel machines scheduling problem. Comput. Oper. Res. 38(1): 301-309 (2011) - Yi Feng, Shaoxiang Chen
, Arun Kumar, Bing Lin:
Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N log N) time. Comput. Oper. Res. 38(4): 717-722 (2011) - Rosa M. V. Figueiredo
, Martine Labbé
, Cid C. de Souza
:
An exact approach to the problem of extracting an embedded network matrix. Comput. Oper. Res. 38(11): 1483-1492 (2011) - Thierry Garaix
, Christian Artigues, Dominique Feillet
, Didier Josselin
:
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Comput. Oper. Res. 38(10): 1435-1442 (2011) - Abel García-Nájera
, John A. Bullinaria:
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 38(1): 287-300 (2011) - Ricardo García-Ródenas
, Ángel Marín, Michael Patriksson
:
Column generation algorithms for nonlinear optimization, II: Numerical investigations. Comput. Oper. Res. 38(3): 591-604 (2011) - Jonathan Gaudreault
, Jean-Marc Frayret, Alain Rousseau, Sophie D'Amours
:
Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry. Comput. Oper. Res. 38(9): 1238-1250 (2011) - Stefan Gollowitzer, Ivana Ljubic
:
MIP models for connected facility location: A theoretical and computational study. Comput. Oper. Res. 38(2): 435-449 (2011) - Hua Gong, Lixin Tang
:
Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput. Oper. Res. 38(9): 1267-1274 (2011) - José A. González
, Jordi Castro
:
A heuristic block coordinate descent approach for controlled tabular adjustment. Comput. Oper. Res. 38(12): 1826-1835 (2011) - Luis Eduardo Neves Gouveia
, Pedro Moura
, Amaro de Sousa
:
Prize collecting Steiner trees with node degree dependent costs. Comput. Oper. Res. 38(1): 234-245 (2011) - Luis Eduardo Neves Gouveia
, Ana Paias
, Stefan Voß
:
Models for a traveling purchaser problem with additional side-constraints. Comput. Oper. Res. 38(2): 550-558 (2011) - Salvatore Greco
, Milosz Kadzinski
, Roman Slowinski
:
Selection of a representative value function in robust multiple criteria sorting. Comput. Oper. Res. 38(11): 1620-1637 (2011) - Ruoxi Guan, Xiaobo Zhao:
Pricing and inventory management in a system with multiple competing retailers under (r, Q) policies. Comput. Oper. Res. 38(9): 1294-1304 (2011) - Kun He, Wenqi Huang:
An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. 38(1): 227-233 (2011) - John E. Hebert, Richard F. Deckro
:
Combining contemporary and traditional project management tools to resolve a project scheduling problem. Comput. Oper. Res. 38(1): 21-32 (2011) - Johann L. Hurink
, A. L. Kok, Jacob Jan Paulus, J. M. J. Schutten
:
Time-constrained project scheduling with adjacent resources. Comput. Oper. Res. 38(1): 310-319 (2011) - Ross J. W. James
, Bernardo Almada-Lobo
:
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38(12): 1816-1825 (2011) - M. C. Janssen, R. J. D. Verbeek, A. Volgenant:
On scheduling a single machine with resource dependent release times. Comput. Oper. Res. 38(3): 713-716 (2011) - Antoine Jouglet, David Savourey:
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. Comput. Oper. Res. 38(9): 1259-1266 (2011) - Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet
:
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants. Comput. Oper. Res. 38(11): 1534-1542 (2011) - Jörg Kalcsics
:
The multi-facility median problem with Pos/Neg weights on general graphs. Comput. Oper. Res. 38(3): 674-682 (2011) - Marnix Kammer, Marjan van den Akker, Han Hoogeveen:
Identifying and exploiting commonalities for the job-shop scheduling problem. Comput. Oper. Res. 38(11): 1556-1561 (2011)