scientific article; zbMATH DE number 2159169
From MaRDI portal
Publication:4667108
zbMath1059.90125MaRDI QIDQ4667108
Klaus M. Wenger, Gerhard Reinelt
Publication date: 19 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-cutcheapest Hamiltonian cycleDantzig-Fulkerson-Johnson TSP modelPadberg-Rinaldi shrinking
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Generating partitions of a graph into a fixed number of minimum weight cuts
Uses Software
This page was built for publication:
