Pages that link to "Item:Q336718"
From MaRDI portal
The following pages link to A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718):
Displaying 13 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
