A branch-and-bound algorithm for the two-dimensional vector packing problem

  title={A branch-and-bound algorithm for the two-dimensional vector packing problem},
  author={Frits C. R. Spieksma},
  journal={Computers & OR},
--The two-dimensional vector packing (ZDVP) problem can be stated as follows. Given are N objects, each of which has two requirements. The problem is to find the minimum number of bins needed to pack all objects, where the capacity of each bin equals 1 in both requirements. A heuristic adapted from the first fit decreasing rule is proposed, and lower bounds for optimal solutions to the 2DVP problem are investigated. Computing one of these lower bounds is shown to be equivalent to computing the… CONTINUE READING
24 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 24 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

Simulation in production

  • D. Vercruyssen, H. Muller
  • A report of the University of Gent, Belgium
  • 1987
Highly Influential
3 Excerpts

Algorithms and Computer Implementations

  • S. Martello, P. Toth, Knapsack Problems
  • Wiley, Chichester
  • 1990
1 Excerpt

minimi~tion of the number of switching instants

  • C. S. Tang, E. V. Denardo, Models arising from a flexible manufacturing machine, part
  • Ops Rex 36,778-784
  • 1988

Approximation algo~thms for bin-packing-an updated survey. In Algorithm Design for Computer System Design (Edited

  • E. C. Coffman, M. R. Garey, D. S. Johnson
  • 1984
1 Excerpt

Prototype models for two-dimensional layout design of robot systems

  • S. C. Sarin, W. E. Wilhelm
  • IIE Trans. 16,
  • 1984
2 Excerpts

A Guide to the Theory of NP-Completeness

  • M. R. Garey, D. S. Johnson, Computers, Intractability
  • Freeman, New York
  • 1979

Similar Papers

Loading similar papers…