Pages that link to "Item:Q2757539"
From MaRDI portal
The following pages link to Persistency in 0-1 Polynomial Programming (Q2757539):
Displayed 5 items.
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)