Generating convex polynomial inequalities for mixed 0-1 programs
From MaRDI portal
Publication:1810867
DOI10.1023/A:1020351410169zbMath1046.90053OpenAlexW1479930027MaRDI QIDQ1810867
Sanjay Mehrotra, Robert A. Stubbs
Publication date: 9 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020351410169
Convex programmingSemidefinite programmingMixed integer programmingMixed integer convex programmingMixed integer nonlinear programming
Semidefinite programming (90C22) Convex programming (90C25) Mixed integer programming (90C11) Nonlinear programming (90C30) Boolean programming (90C09)
Related Items (5)
Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming ⋮ Computational approaches for mixed integer optimal control problems with indicator constraints ⋮ Conic mixed-integer rounding cuts ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ Cuts for mixed 0-1 conic programming
This page was built for publication: Generating convex polynomial inequalities for mixed 0-1 programs
