Pages that link to "Item:Q4645914"
From MaRDI portal
The following pages link to A heuristic algorithm for the set covering problem (Q4645914):
Displaying 11 items.
- Ad hoc heuristic for the cover printing problem (Q435726) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- (Q4735035) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)