Approximation algorithms for integer covering problems via greedy column generation

DOI10.1051/ro/1994280302831zbMath0830.90107OpenAlexW2465537058MaRDI QIDQ4846487

Joris van de Klundert, Yves Cramer

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

coveringgreedy algorithmcutting stock

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Hybrid column generation for large-size covering integer programs: application to transportation planning ⋮ Column-Generation in Integer Linear Programming ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems

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