Pages that link to "Item:Q1309874"
From MaRDI portal
The following pages link to Algorithms for large scale set covering problems (Q1309874):
Displaying 25 items.
- Using a facility location algorithm to solve large set covering problems (Q796457) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- Solving large set covering problems on a personal computer (Q1097839) (← links)
- 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)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← 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)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (Q3787788) (← links)
- (Q3831014) (← links)
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535) (← links)
- A Heuristic Method for the Set Covering Problem (Q4950819) (← links)
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039) (← links)
- Benchmark data set with service programs to approximately solve the set covering problem (Q5756398) (← links)
