Pages that link to "Item:Q3565240"

The following pages link to Polyhedral Approaches to Mixed Integer Linear Programming (Q3565240):

Displaying 16 items.

• A polyhedral approach to the single row facility layout problem (Q378107) (← links)
• Some properties of convex hulls of integer points contained in general convex sets (Q378131) (← links)
• Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
• Constraint qualification failure in action (Q1694785) (← links)
• On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
• Partially distributed outer approximation (Q2046262) (← links)
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
• New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
• Exact Solution of the Evasive Flow Capturing Problem (Q5131542) (← links)
• Extended formulations in combinatorial optimization (Q5900907) (← links)
• Extended formulations in combinatorial optimization (Q5919994) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)