A branch-and-cut algorithm for the target visitation problem

DOI10.1007/s13675-019-00111-xzbMath1431.90094OpenAlexW2942001908WikidataQ127962012 ScholiaQ127962012MaRDI QIDQ2294072

Achim Hildenbrandt

Publication date: 10 February 2020

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-019-00111-x

zbMATH Keywords

traveling salesman problembranch-and-cutlinear ordering problempolyhedra theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• PORTA
• LOLIB
• HUHFA

Cites Work

• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A semidefinite optimization approach to the target visitation problem
• Hamiltonian path and symmetric travelling salesman polytopes
• A Random Keys Based Genetic Algorithm for the Target Visitation Problem
• Facets of the linear ordering polytope
• Lectures on Polytopes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A branch-and-cut algorithm for the target visitation problem