Related references
Note: Only part of the references are listed.Combinatorial optimization and green logistics
Abdelkader Sbihi et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2007)
Lower and upper bounds for the mixed capacitated arc routing problem
Jose-Manuel Belenguer et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
A constraint programming approach to the Chinese postman problem with time windows
U. F. Aminu et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Road Timetable™ to aid vehicle routing and scheduling
R Eglese et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Dynamic lot sizing with product returns and remanufacturing
Ruud H. Teunter et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2006)
The real-time time-dependent vehicle routing problem
Huey-Kuo Chen et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2006)
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
R Fukasawa et al.
MATHEMATICAL PROGRAMMING (2006)
Solving capacitated arc routing problems using a transformation to the CVRP
H Longo et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
A Scatter Search for the Periodic Capacitated Arc Routing Problem
F Chu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Exact methods based on node-routing formulations for undirected Arc-Routing Problems
R Baldacci et al.
NETWORKS (2006)
A dynamic vehicle routing problem with time-dependent travel times
A Haghani et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
Evolutionary algorithms for periodic arc routing problems
P Lacomme et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)
Heuristics for the periodic capacitated arc routing problem
F Chu et al.
JOURNAL OF INTELLIGENT MANUFACTURING (2005)
Vehicle routing in the 1-skip collection problem
C Archetti et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2004)
Recyclable waste collection planning - a case study
J Teixeira et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
A new branch-and-cut algorithm for the capacitated vehicle routing problem
J Lysgaard et al.
MATHEMATICAL PROGRAMMING (2004)
Competitive memetic algorithms for arc routing problems
P Lacomme et al.
ANNALS OF OPERATIONS RESEARCH (2004)
A guided local search heuristic for the capacitated arc routing problem
P Beullens et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2003)
A tabu scatter search metaheuristic for the arc routing problem
P Greistorfer
COMPUTERS & INDUSTRIAL ENGINEERING (2003)
Product recovery with some byte: an overview of management challenges and environmental consequences in reverse manufacturing for the computer industry
CD White et al.
JOURNAL OF CLEANER PRODUCTION (2003)
A reverse logistics cost minimization model for the treatment of hazardous wastes
TL Hu et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2002)
A variable neighborhood descent algorithm for the undirected capacitated arc routing problem
A Hertz et al.
TRANSPORTATION SCIENCE (2001)
A characterisation of logistics networks for product recovery
M Fleischmann et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2000)
The rollon-rolloff vehicle routing problem
L Bodin et al.
TRANSPORTATION SCIENCE (2000)
Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
N Dellaert et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2000)
Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
MC Mourao et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
A tabu search heuristic for the capacitated arc routing problem
A Hertz et al.
OPERATIONS RESEARCH (2000)