Pages that link to "Item:Q2452382"
From MaRDI portal
The following pages link to Disjunctive programming and relaxations of polyhedra (Q2452382):
Displaying 9 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
- Geometric proofs for convex hull defining formulations (Q1755829) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base (Q4018150) (← links)
- (Q4705029) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)