Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exact algorithm for bin covering

Exact algorithm for bin covering This paper presents a new arc flow model for the one-dimensional bin covering problem and an algorithm to solve the problem exactly through a branch-and-bound procedure and the technique of column generation. The subproblems occuring in the procedure of branch-and-bound have the same structure and therefore can be solved by the same algorithm. In order to solve effectively the subproblems which are generally large scale, a column generation algorithm is employed. Many rules found in this paper can improve the performance of the methods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Zhejiang University - Science A Springer Journals

Exact algorithm for bin covering

Download PDF
6 pages

Loading next page...
 
/lp/springer-journals/exact-algorithm-for-bin-covering-dV0glGOeXg

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2001 by Zhejiang University Press
Subject
Engineering; Mechanical Engineering; Civil Engineering; Mechanics, Fluids, Thermodynamics; Industrial Chemistry/Chemical Engineering
ISSN
1673-565X
eISSN
1862-1775
DOI
10.1007/BF02839452
Publisher site
See Article on Publisher Site

Abstract

This paper presents a new arc flow model for the one-dimensional bin covering problem and an algorithm to solve the problem exactly through a branch-and-bound procedure and the technique of column generation. The subproblems occuring in the procedure of branch-and-bound have the same structure and therefore can be solved by the same algorithm. In order to solve effectively the subproblems which are generally large scale, a column generation algorithm is employed. Many rules found in this paper can improve the performance of the methods.

Journal

Journal of Zhejiang University - Science A – Springer Journals

Published: Jul 1, 2001

There are no references for this article.