Pages that link to "Item:Q4139972"

The following pages link to Polyhedral annexation in mixed integer and combinatorial programming (Q4139972):

Displaying 14 items.

• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• A simplification for some disjunctive formulations (Q1104856) (← links)
• Strengthening cuts for mixed integer programs (Q1142702) (← links)
• A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
• Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
• A note on duality in disjunctive programming (Q1229803) (← links)
• A converse for disjunctive constraints (Q1238749) (← links)
• Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
• Representability of functions (Q1825755) (← links)
• Optimality conditions for disjunctive optimization in reflexive Banach spaces (Q2260683) (← 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)
• Minimal inequalities (Q3879045) (← links)