Pages that link to "Item:Q2204628"
From MaRDI portal
The following pages link to A two-phase heuristic for set covering (Q2204628):
Displaying 11 items.
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Solving large set covering problems on a personal computer (Q1097839) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- A set-covering-based heuristic approach for bin-packing problems (Q2892273) (← links)
- (Q4735035) (← links)
- Ambulance location routing problem considering all sources of uncertainty: progressive estimating algorithm (Q6068732) (← links)