A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
From MaRDI portal
(Redirected from Publication:336718)
A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
Recommendations
- Experiments with LAGRASP heuristic for set \(k\)-covering
- scientific article; zbMATH DE number 4121754
- Simple Lagrangian heuristic for the set covering problem
- A heuristic algorithm for the set covering problem
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Cites work
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Heuristic Method for the Set Covering Problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An algorithm for set covering problem
- An annotated bibliography of GRASP – Part I: Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- Approximation algorithms for combinatorial problems
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP: An annoted bibliography
- Greedy randomized adaptive search procedures
- Heuristic solutions and confidence intervals for the multicovering problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- TTT plots: a perl program to create time-to-target plots
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The multicovering problem
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(14)- MLQCC: an improved local search algorithm for the set k‐covering problem
- Probabilistic stopping rules for GRASP heuristics and extensions
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Decomposition based hybrid metaheuristics
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- Experiments with LAGRASP heuristic for set \(k\)-covering
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
- An improved configuration checking-based algorithm for the unicost set covering problem
- Hyperbolic set covering problems with competing ground-set elements
This page was built for publication: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336718)
