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

DOI10.1007/S13675-019-00111-XMaRDI QIDQ2294072zbMATH OpenOpenAlexWikidataFDO

Authors Achim Hildenbrandt

Publication date 10 February 2020

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20) Integer programming (90C10) Paths and cycles (05C38)

Recommendations

• A semidefinite optimization approach to the target visitation problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• scientific article; zbMATH DE number 1769325
• The target visitation arc routing problem
• Branch-and-cut approach to a variant of the traveling salesman problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• The target visitation problem
• A branch-and-cut framework for the consistent traveling salesman problem
• A branch and bound algorithm for the traveling purchaser problem

Cites work

• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• A random keys based genetic algorithm for the target visitation problem
• A semidefinite optimization approach to the target visitation problem
• Facets of the linear ordering polytope
• Hamiltonian path and symmetric travelling salesman polytopes
• Lectures on Polytopes
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The target visitation problem
• The traveling salesman problem. A computational study.

Cited in

(3)

• The target visitation arc routing problem
• The target visitation problem
• A semidefinite optimization approach to the target visitation problem

Describes a project that uses

Uses Software

• PORTA
• LOLIB
• HUHFA

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

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