Perspective cuts for a class of convex 0-1 mixed integer programs
From MaRDI portal
Publication:2490334
DOI10.1007/s10107-005-0594-3zbMath1134.90447WikidataQ118165502 ScholiaQ118165502MaRDI QIDQ2490334
Antonio Frangioni, Claudio Gentile
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0594-3
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C20: Quadratic programming
Related Items
On interval-subgradient and no-good cuts, Extending the QCR method to general mixed-integer programs, A strong conic quadratic reformulation for machine-job assignment with controllable processing times, A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes, Demand allocation with latency cost functions, Perspective cuts for a class of convex 0-1 mixed integer programs, Perspective reformulations of mixed integer nonlinear programs with indicator variables, SDP diagonalizations and perspective cuts for a class of nonseparable MIQP, Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Cites Work
- Unnamed Item
- About Lagrangian methods in integer optimization
- A convex envelope formula for multilinear functions
- Convex extensions and envelopes of lower semi-continuous functions
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Generalized Bundle Methods
