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

DOI10.1007/BF02578930zbMath1148.90339MaRDI QIDQ703298

Rafael Pastor, Albert Corominas

Publication date: 11 January 2005

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

branch and boundartificial intelligenceCombinatorial optimization

Mathematics Subject Classification ID

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

Related Items (1)

A branch and bound algorithm for the response time variability problem

Cites Work

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

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