The generalized arc routing problem

DOI10.1007/S11750-017-0437-4MaRDI QIDQ1688441zbMATH OpenOpenAlexFDO

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

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

TSPmathematical programmingoperations researchfacetsroutingvalid inequalitiesarc routingbranch and cutCPLEXpolyhedral modeling

Mathematics Subject Classification ID

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

Recommendations

• A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
• The mixed general routing polyhedron
• Recent results on arc routing problems: an annotated bibliography
• scientific article; zbMATH DE number 956790
• Some Applications of the Generalized Travelling Salesman Problem

Cites work

• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• A cutting plane algorithm for the general routing problem
• A fundamental problem in vehicle routing
• A polyhedral approach to the rural postman problem
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• An algorithm for the Rural Postman problem on a directed graph
• Arc Routing
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Improvement Procedures for the Undirected Rural Postman Problem
• Lower bounds and heuristics for the windy rural postman problem
• Maximum matching and a polyhedron with 0,1-vertices
• Odd Minimum Cut Sets and b-Matchings Revisited
• Odd Minimum Cut-Sets and b-Matchings
• On the cycle polytope of a binary matroid
• Solving the close-enough arc routing problem
• Solving the prize-collecting rural postman problem
• The capacitated arc routing problem: Valid inequalities and facets
• The generalized arc routing problem

Cited in

(23)

• scientific article; zbMATH DE number 1568946 (Why is no real title available?)
• 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 rescheduling arc routing problem
• The Steiner traveling salesman problem and its extensions
• A matheuristic for the distance-constrained close-enough arc routing problem
• The min-max close-enough arc routing problem
• The target visitation arc routing problem
• scientific article; zbMATH DE number 1568938 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• The profitable close-enough arc routing problem
• The generalized packet routing problem
• An improved multi-objective framework for the rich arc routing problem
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• An updated annotated bibliography on arc routing problems
• scientific article; zbMATH DE number 2156293 (Why is no real title available?)
• On the distance-constrained close enough arc routing problem
• Arc routing problems: A review of the past, present, and future
• The Arc Routing and Scheduling Problem with Transshipment
• scientific article; zbMATH DE number 6741969 (Why is no real title available?)
• The generalized arc routing problem
• Arc routing problems with time-dependent service costs
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• Approximation algorithms for two clustered arc routing problems

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The generalized arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688441)