Pages that link to "Item:Q1265886"
From MaRDI portal
The following pages link to Reformulation of the set partitioning problem as a pure network with special order set constraints (Q1265886):
Displaying 6 items.
- Linear programming formulation of the set partitioning problem (Q604761) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)