Column generation extensions of set covering greedy heuristics
From MaRDI portal
Publication:2102849
Recommendations
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- What is the best greedy-like heuristic for the weighted set covering problem?
- A heuristic algorithm for the set covering problem
- An efficient heuristic for large set covering problems
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Cites work
- scientific article; zbMATH DE number 1256704 (Why is no real title available?)
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- Computational experience with approximation algorithms for the set covering problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Fractional 0-1 programming: applications and algorithms
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Simple Lagrangian heuristic for the set covering problem
- What is the best greedy-like heuristic for the weighted set covering problem?
Cited in
(4)- scientific article; zbMATH DE number 2089889 (Why is no real title available?)
- All-integer column generation for set partitioning: basic principles and extensions
- Searching for optimal integer solutions to set partitioning problems using column generation
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
This page was built for publication: Column generation extensions of set covering greedy heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102849)
