Pages that link to "Item:Q604761"
From MaRDI portal
The following pages link to Linear programming formulation of the set partitioning problem (Q604761):
Displaying 6 items.
- Linear programming formulation of the vertex colouring problem (Q975796) (← links)
- Reformulation of the set partitioning problem as a pure network with special order set constraints (Q1265886) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Linear-shaped partition problems (Q1577471) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)