An approximate 0-1 edge-labeling algorithm for constrained bin-packing problem

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1997, Pages 1402-1407

  Lee, HoSoo ^a   Trumbo, Mark ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANY-TIME ALGORITHMS; BIN PACKING PROBLEM; BIN-PACKING; BINARY VALUES; CONSTRAINT PROPAGATION; HEURISTIC SEARCH; INDUSTRIAL-SCALE; SCHEDULING PROBLEM;

BINS; HEURISTIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 34547398133     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Michael Garey and David Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
2. D. Knuth, Estimating the efficiency of backtracking programs, Mathematics of Computation 29, No. 129, pages 121-136, 1975.
3. T. Dean and M. Boddy, An analysis of time-depending planning, Proceedings of the 1th National Conference on Artificial Intelligence, pages 49-54, 1988.
4. E. Lawler, J. Lenstra, A. Rinnooy and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley and Sons, 1985.
5. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, 1990.
6. S. Eilon and N. Christofides, The loading problem, Management Science 17, pages 259-267, 1971.
7. M. Hung and J. Brown, An algorithm for a class of loading problems, Naval Research Logistics 25, pages 289-297, 1978.
8. N. Nilsson, Principles of Artificial Intelligence, Tioga Press, 1980.
9. P. Winston, Artificial Intelligence (second edition), Addison-Wesley, 1984.
10. T. Vollman, T. Berry and D. Whybark, Manufacturing Planning and Control Systems, Irwin, 1992.