Pages that link to "Item:Q1580446"
From MaRDI portal
The following pages link to Network based heuristics for the set covering problem (Q1580446):
Displaying 4 items.
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
- A computational approach to pivot selection in the LP relaxation of set problems (Q955467) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Innovative cost allocation strategies for the shortest route relaxation of the set covering problem (Q2907709) (← links)