Pages that link to "Item:Q1002077"
From MaRDI portal
The following pages link to Computational experience with general cutting planes for the set covering problem (Q1002077):
Displayed 12 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Optimizing word set coverage for multi-event summarization (Q887893) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities (Q6119446) (← links)