Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
From MaRDI portal
Publication:2638385
DOI10.1007/s10107-010-0374-6zbMath1198.90298MaRDI QIDQ2638385
Mohit Tawarmalani, Kwanghun Chung, Jean-Philippe P. Richard
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0374-6
90C10: Integer programming
90C26: Nonconvex programming, global optimization
46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics
Related Items
Uses Software
Cites Work
- Unnamed Item
- Projection, lifting and extended formulation integer and combinatorial optimization
- Chvátal closures for mixed integer programming problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Different transformations for solving non-convex trim-loss problems by MINLP
- Shelling polyhedral 3-balls and 4-polytopes
- Convex extensions and envelopes of lower semi-continuous functions
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Global optimization and constraint satisfaction. First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2--4, 2002. Revised selected papers
- On unions and dominants of polytopes
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- A convex-analysis perspective on disjunctive cuts
- Strong formulations of robust mixed 0-1 programming
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Branching and bounds tighteningtechniques for non-convex MINLP
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Complete search in continuous global optimization and constraint satisfaction
- An Algorithm for Separable Nonconvex Programming Problems
- Convex Analysis
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Extended convex hull
- Semidefinite relaxations of fractional programs via novel convexification techniques
