Pages that link to "Item:Q5930736"
From MaRDI portal
The following pages link to A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736):
Displaying 33 items.
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- A finitely converging cutting plane technique (Q1060961) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- A simple finite cutting plane algorithm for integer programs (Q1939718) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- A finite cutting plane method for facial disjunctive programs (Q3971356) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
