Column generation extensions of set covering greedy heuristics
From MaRDI portal
Publication:2102849
DOI10.1016/j.orl.2022.10.014OpenAlexW4308516706MaRDI QIDQ2102849
Torbjörn Larsson, Nils-Hassan Quttineh
Publication date: 12 December 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.10.014
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple Lagrangian heuristic for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A Lagrangian-based heuristic for large-scale set covering problems
- Fractional 0-1 programming: applications and algorithms
- What is the best greedy-like heuristic for the weighted set covering problem?
- An algorithm for set covering problem
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An efficient heuristic for large set covering problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
This page was built for publication: Column generation extensions of set covering greedy heuristics
