scientific article

zbMath0727.90064MaRDI QIDQ3351148

No author found.

Publication date: 1990

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

zbMATH Keywords

branch and cut methodcomplexity of the traveling salesmanexponential worst-case running time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

Complexity of optimizing over the integers ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ On the Chvátal rank of polytopes in the 0/1 cube ⋮ Lower bound on size of branch-and-bound trees for solving lot-sizing problem

This page was built for publication: