Pages that link to "Item:Q1968795"
From MaRDI portal
The following pages link to A branch-and-cut method for 0-1 mixed convex programming (Q1968795):
Displayed 19 items.
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
