Pages that link to "Item:Q715071"

The following pages link to On convergence in mixed integer programming (Q715071):

Displaying 20 items.

• On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Reverse split rank (Q896287) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Generalized halfspaces in the mixed-integer realm (Q1038603) (← links)
• Integral decomposition of polyhedra and some applications in mixed integer programming (Q1411609) (← links)
• Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
• Lattice closures of polyhedra (Q2188243) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• The triangle closure is a polyhedron (Q2248744) (← links)
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results (Q2359925) (← links)
• Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
• On the mixed integer signomial programming problems (Q2573603) (← links)
• Generalized flatness constants, spanning lattice polytopes, and the Gromov width (Q2686594) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)