We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...

This paper first examines the role of ceiling points in solving a pure, general integer linear programming problem (P). Several kinds of ceiling points are defined and analyzed and one kind called "feasible 1-ceiling points" proves to be of special interest. We demonstrate that all optimal...

This paper presents a mathematical model that selects locations for Internal Revenue Service Posts-of-Duty. The system is microcomputer-based and uses menus and graphically displayed zip code maps of IRS districts for interactive inputs and solution outputs. The mathematical model used for this...