Approximation algorithms for integer covering problems via greedy column generation

DOI10.1051/RO/1994280302831MaRDI QIDQ4846487zbMATH OpenOpenAlexFDO

Authors Joris van de Klundert, Yves Crama

Publication date 11 February 1996

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105086

zbMATH Keywords

greedy algorithmcoveringcutting stock

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Rounding algorithms for covering problems
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• A modified greedy heuristic for the set covering problem with improved worst case bound
• Approximation algorithms for covering/packing integer programs
• scientific article; zbMATH DE number 784428

Cited in

(6)

• Searching for optimal integer solutions to set partitioning problems using column generation
• Column-Generation in Integer Linear Programming
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
• Hybrid column generation for large-size covering integer programs: application to transportation planning
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• scientific article; zbMATH DE number 1564049 (Why is no real title available?)

This page was built for publication: Approximation algorithms for integer covering problems via greedy column generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846487)