scientific article; zbMATH DE number 1779967

MaRDI QIDQ4543185zbMATH OpenFDO

Authors Feng Chen, Enyu Yao

Publication date 12 August 2002

zbMATH Keywords

branch-and-bound algorithmcolumn generation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact solution of bin-packing problems using column generation and branch-and-bound
• A set-covering-based heuristic approach for bin-packing problems
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Approximation algorithms for generalized and variable-sized bin covering
• A min-cost bin covering problem and its algorithm

Cited in

(3)

• Exact solution of bin-packing problems using column generation and branch-and-bound
• Bin covering with cardinality constraints
• Two simple algorithms for bin covering

This page was built for publication:

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