Incorporating Condition Measures in the Context of Combinatorial Optimization
From MaRDI portal
Publication:5470227
DOI10.1137/040609264zbMath1131.90035OpenAlexW2005167978MaRDI QIDQ5470227
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/177169
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (2)
Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Complexity indices for the multidimensional knapsack problem
This page was built for publication: Incorporating Condition Measures in the Context of Combinatorial Optimization