The following pages link to (Q3325466):
Displaying 4 items.
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Learning accurate cutset networks by exploiting decomposability (Q2294082) (← links)
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions (Q3703585) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)