On path-bridge inequalities for the orienteering arc routing problems

DOI10.1080/02331934.2019.1702984zbMath1460.90112OpenAlexW2994843473MaRDI QIDQ5151530

Mostafa Khorramizadeh

Publication date: 19 February 2021

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1702984

zbMATH Keywords

arc routing problemorienteering arc routing problemfacet inducingpath-bridge inequalityrouting problem with profits

Mathematics Subject Classification ID

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

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• A branch-and-cut algorithm for the orienteering arc routing problem
• The orienteering problem: a survey
• The mixed general routing polyhedron
• Locating a cycle in a transportation or a telecommunications network
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• An algorithm for the Rural Postman problem on a directed graph
• The orienteering problem
• Depth-First Search and Linear Graph Algorithms
• A cutting plane algorithm for the general routing problem