Column generation extensions of set covering greedy heuristics
From MaRDI portal
Publication:2102849
DOI10.1016/J.ORL.2022.10.014OpenAlexW4308516706MaRDI QIDQ2102849FDOQ2102849
Authors: 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
Cites Work
- Computational experience with approximation algorithms for the set covering problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Title not available (Why is that?)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A Lagrangian-based heuristic for large-scale set covering problems
- An algorithm for set covering problem
- 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
- Title not available (Why is that?)
- A Heuristic Method for the Set Covering Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- Title not available (Why is that?)
- What is the best greedy-like heuristic for the weighted set covering problem?
- Fractional 0-1 programming: applications and algorithms
- Simple Lagrangian heuristic for the set covering problem
- Title not available (Why is that?)
Cited In (4)
- Title not available (Why is that?)
- 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
Uses Software
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)
