scientific article
From MaRDI portal
Publication:2999650
zbMath1223.90050MaRDI QIDQ2999650
Sylvia Boyd, Paul Elliott-Magwood
Publication date: 16 May 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (4)
Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming ⋮ Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices ⋮ On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ Unnamed Item
Uses Software
This page was built for publication:
