The target visitation problem

MaRDI QIDQ5498893zbMATH OpenFDO

Authors Achim Hildenbrandt

Publication date 11 February 2015

Full work available at URL http://archiv.ub.uni-heidelberg.de/volltextserver/17993/1/The_TVP_Story.pdf

zbMATH Keywords

facepolytopetarget visitation problemtravel salesman problemlinear order problem

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• A branch-and-cut algorithm for the target visitation problem
• A semidefinite optimization approach to the target visitation problem
• The target visitation arc routing problem
• A random keys based genetic algorithm for the target visitation problem
• scientific article; zbMATH DE number 1305099

Cited in

(6)

• The target visitation arc routing problem
• Rank aggregation in cyclic sequences
• A semidefinite optimization approach to the target visitation problem
• scientific article; zbMATH DE number 842015 (Why is no real title available?)
• A branch-and-cut algorithm for the target visitation problem
• A random keys based genetic algorithm for the target visitation problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The target visitation problem

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