Pages that link to "Item:Q2553385"

The following pages link to Cutting-planes for programs with disjunctive constraints (Q2553385):

Displaying 12 items.

• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• A strong duality theorem for the minimum of a family of convex programs (Q1131953) (← links)
• Strengthening cuts for mixed integer programs (Q1142702) (← links)
• A note on duality in disjunctive programming (Q1229803) (← links)
• A converse for disjunctive constraints (Q1238749) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
• Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
• Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)