The generalized arc routing problem

DOI10.1007/s11750-017-0437-4zbMath1411.90288OpenAlexW2586457066MaRDI QIDQ1688441

Elena Fernández, Carles Franquesa, Julián Aráoz

Publication date: 5 January 2018

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-017-0437-4

zbMATH Keywords

TSPbranch and cutmathematical programmingvalid inequalitiesroutingfacetsoperations researcharc routingCPLEXpolyhedral modeling

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

The profitable close-enough arc routing problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ The generalized arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ The Steiner traveling salesman problem and its extensions ⋮ A matheuristic for the distance-constrained close-enough arc routing problem ⋮ On the distance-constrained close enough arc routing problem ⋮ Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities ⋮ The min-max close-enough arc routing problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Lower bounds and heuristics for the windy rural postman problem
• Solving the prize-collecting rural postman problem
• On the cycle polytope of a binary matroid
• A polyhedral approach to the rural postman problem
• The capacitated arc routing problem: Valid inequalities and facets
• A branch-and-cut algorithm for the undirected rural postman problem
• The generalized arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Solving the close-enough arc routing problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Odd Minimum Cut Sets and b-Matchings Revisited
• An algorithm for the Rural Postman problem on a directed graph
• Odd Minimum Cut-Sets and b-Matchings
• A fundamental problem in vehicle routing
• Improvement Procedures for the Undirected Rural Postman Problem
• Arc Routing
• Maximum matching and a polyhedron with 0,1-vertices
• A cutting plane algorithm for the general routing problem