Multi-depot rural postman problems

On the Collaboration Uncapacitated Arc Routing Problem

(2016) Elena Fernández et al.   COMPUTERS & OPERATIONS RESEARCH

An approach to the asymmetric multi-depot capacitated arc routing problem

(2015) Dmitry Krushinsky et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

(2015) Adam N. Letchford et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A novel model for arc territory design: promoting Eulerian districts

(2015) Gabriela García-Ayala et al.   International Transactions in Operational Research

A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem

(2013) Enrique Benavent et al.   NETWORKS

Applying min–max k postmen problems to the routing of security guards

(2011) E J Willemse et al.   JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

(2011) Ángel Corberán et al.   MATHEMATICAL PROGRAMMING

New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem

(2011) Enrique Benavent et al.   NETWORKS

The Windy Clustered Prize-Collecting Arc-Routing Problem

(2011) Ángel Corberán et al.   TRANSPORTATION SCIENCE

An Evolutionary Approach to the Multidepot Capacitated Arc Routing Problem

(2009) Lining Xing et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

Min-MaxK-vehicles windy rural postman problem

(2009) Enrique Benavent et al.   NETWORKS

The Clustered Prize-Collecting Arc Routing Problem

(2009) Julián Aráoz et al.   TRANSPORTATION SCIENCE

Solving the Prize-collecting Rural Postman Problem

(2008) Julián Aráoz et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH