Related references
Note: Only part of the references are listed.Two heuristics for the capacitated minimum spanning tree problem with time windows
Manolis N. Kritikos et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2019)
A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew's working time
Erfan Babaee Tirkolaee et al.
WASTE MANAGEMENT (2018)
The windy rural postman problem with a time-dependent zigzag option
Jenny Nossack et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
A greedy heuristic for the capacitated minimum spanning tree problem
M. Kritikos et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2017)
Routing Problems with Time Dependencies or how Different are Trash Collection or Newspaper Delivery from Street Sweeping or Winter Gritting?
Bruce Golden et al.
7TH INTERNATIONAL CONFERENCE ON ENGINEERING, PROJECT, AND PRODUCTION MANAGEMENT (2017)
A hybrid metaheuristic approach for the capacitated arc routing problem
Yuning Chen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Improving branch-and-cut performance by random sampling
Matteo Fischetti et al.
MATHEMATICAL PROGRAMMING COMPUTATION (2016)
How important are branching decisions: Fooling MIP solvers
Pierre Le Bodic et al.
OPERATIONS RESEARCH LETTERS (2015)
Location-arc routing problem: Heuristic approaches and test instances
Rui Borges Lopes et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach
Cihan Cetinkaya et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem
L. Grandinetti et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
BRKGA Algorithm for the Capacitated Arc Routing Problem
C. Martinez et al.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2011)
Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows
Pieter Vansteenwegen et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem
T. Oencan et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2009)
Arc routing problems with time-dependent service costs
Mariam Tagmouti et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A constraint programming approach to the Chinese postman problem with time windows
U. F. Aminu et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Share Paper
