Pages that link to "Item:Q1342046"
From MaRDI portal
The following pages link to A surrogate heuristic for set covering problems (Q1342046):
Displayed 14 items.
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- A comparison of algorithm RS with algorithm OPTSOL70 (Q1383315) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)