AND/OR branch-and-bound search for pure 0/1 integer linear programming problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 152-166

  Marinescu, Radu ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; GRAPHIC METHODS; HEURISTIC METHODS; LINEAR EQUATIONS; SENSITIVITY ANALYSIS;

AND/OR BRANCH-BOUND ALGORITHM; INTEGER LINEAR PROGRAMMING; PARADIGM; UNCAPACITATED WAREHOUSE LOCATION PROBLEMS;

INTEGER PROGRAMMING;

EID: 33746094631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_14     Document Type: Conference Paper

References (20)

1. R. Marinescu and R. Dechter. And/or branch-and-bound for graphical models. In International Joint Conference on Artificial Intelligence (IJCAI'05), pages 224-229, 2005.
2. G. Kernhauser and L. Wolsey. Integer and combinatorial optimization. Wiley, 1988.
3. E. Lawler and D. Wood. Branch-and-bound methods: A survey. Operations Research, 14(4):699-719, 1966.
4. R. Dechter and R. Mateescu. And/or search spaces for graphical models. UCI-ICS Techical Report, 2006.
5. G.B. Dantzig. Maximization of a linear function of variables subject to linear inequalities. Activity Analysis of Production and Allocation, 1951.
6. M. Vasquez and J. Hao. A hybrid approach for the 0/1 multidimensional knapsack approach. In International Joint Conference on Artificial Intelligence (IJCAI'01), pages 328-333, 2001.
7. W. Shih. A branch-and-bound method for the multiconstraint 0/1 knapsack problem. Journal of the Operational Research Society, 30:369-378, 1979.
8. B. Gavish and H. Pirkul. Allocation of data bases and processors in a distributed computing system. Management of Distributed Data Processing, 31:215-231, 1982.
9. T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In International Joint Conference on Artificial Intelligence (IJCAI'99), pages 542-547, 1999.
10. K. Leyton-Brown, M. Pearson, and Y. Shoham. Towards a universal test suite for combinatorial auction algorithms. In ACM Electronic Commerce, pages 66-76, 2000.
11. E. Freuder and M. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In International Joint Conference on Artificial Intelligence (IJCAI'85), pages 1076-1078, 1985.
12. R. Bayardo and D. Miranker. On the space-time trade-off in solving constraint satisfaction problems. In International Joint Conference on Artificial Intelligence (IJCAI'95), pages 558-562, 1995.
13. A. Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001.
14. Rina Dechter. Constraint Processing. MIT Press, 2003.
15. J. Pearl. Heuristics: Intelligent search strategies for computer problem solving. Addison-Welsey, 1984.
16. L. Kanal and V. Kumar. Search in artificial intelligence. Springer-Verlag., 1988.
17. J. Larrosa, P. Meseguer, and M. Sanchez. Pseudo-tree search with soft constraints. In European Conference on Artificial Intelligence (ECAI'02), pages 131-135, 2002.
18. P. Jegou and C. Terrioux. Decomposition and good recording for solving max-csps. In European Conference on Artificial Intelligence (ECAI'04), pages 196-200, 2004.
19. J. Huang and A. Darwiche. A structure-based variable ordering heuristic. In International Joint Conference on Artificial Intelligence (IJCAI'03), pages 1167-1172, 2003.
20. W. Li and P. van Beek. Guiding real-world sat solving with dynamic hypergraph separator decomposition. In International Conference on Tools with Artificial Intelligence (ICTAI'04), pages 542-548, 2004.