Semi-continuous cuts for mixed-integer programming
From MaRDI portal
Recommendations
- An optimality cut for mixed integer linear programs
- Cuts for Conic Mixed-Integer Programming
- Disjunctive cuts for mixed integer nonlinear programming problems
- Partial convexification cuts for 0--1 mixed-integer programs
- A cutting plane theory for mixed integer optimization
- Disjunctive cuts in mixed-integer conic optimization
- Cuts for mixed 0-1 conic programming
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Split cuts for robust mixed-integer optimization
Cited in
(11)- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Semi-continuous network flow problems
- A polyhedral study of the semi-continuous knapsack problem
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Relaxations of discrete sets with semicontinuous variables
- Challenges in Enterprise Wide Optimization for the Process Industries
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
This page was built for publication: Semi-continuous cuts for mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712451)
