The Sharpest Cut
From MaRDI portal
Publication:4825156
DOI10.1137/1.9780898718805zbMath1050.90003OpenAlexW612467775MaRDI QIDQ4825156
No author found.
Publication date: 5 November 2004
Full work available at URL: https://doi.org/10.1137/1.9780898718805
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Festschriften (00B30) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (1)
This page was built for publication: The Sharpest Cut