Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

DOI10.1007/BF02578930MaRDI QIDQ703298zbMATH OpenFDO

Authors Rafael Pastor, Albert Corominas

Publication date 11 January 2005

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02578930

zbMATH Keywords

artificial intelligencebranch and boundCombinatorial optimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• scientific article; zbMATH DE number 1935510
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• scientific article; zbMATH DE number 49948
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A branch-and-reduce approach to global optimization
• A common schema for dynamic programming and branch and bound algorithms
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• A hybrid approach to discrete mathematical programming
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Branch and peg algorithms for the simple plant location problem
• Constraint satisfaction problems: Algorithms and applications
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• General branch and bound, and its relation to A^* and AO^*
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 43711 (Why is no real title available?)
• scientific article; zbMATH DE number 3804893 (Why is no real title available?)
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

Cited in

(3)

• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
• A branch and bound algorithm for the response time variability problem

This page was built for publication: Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703298)