Pages that link to "Item:Q5930736"

The following pages link to A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736):

Displaying 18 items.

• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• On convergence in mixed integer programming (Q715071) (← links)
• Depth-optimized convexity cuts (Q817181) (← links)
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
• Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
• Cook, Kannan and Schrijver's example revisited (Q955332) (← 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)
• 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)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)