Solving general capacity problem by relaxed cutting plane approach
From MaRDI portal
Publication:5959296
DOI10.1023/A:1012907206299zbMath1007.90078OpenAlexW1613962895MaRDI QIDQ5959296
Soon-Yi Wu, Shu-Cherng Fang, Chih-Jen Lin
Publication date: 26 March 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012907206299
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Programming in abstract spaces (90C48)
Related Items
Potential theory and quadratic programming ⋮ Algorithms for infinite quadratic programming in \(L_p\) spaces ⋮ γ-Active Constraints in Convex Semi-Infinite Programming