Pages that link to "Item:Q1309874"
From MaRDI portal
The following pages link to Algorithms for large scale set covering problems (Q1309874):
Displaying 11 items.
- A structural Lagrangean relaxation for two-duty period bus driver scheduling problems (Q1121170) (← links)
- The multicovering problem (Q1205691) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
