scientific article; zbMATH DE number 6400886

zbMath1322.90050MaRDI QIDQ5498893

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

facepolytopetarget visitation problemtravel salesman problemlinear order problem

Mathematics Subject Classification ID

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

Related Items (2)

Rank aggregation in cyclic sequences ⋮ A branch-and-cut algorithm for the target visitation problem

Uses Software

• CPLEX

This page was built for publication: