Results 241 to 250 of about 25,776 (266)

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem

2014
Finding the largest clique in a given graph is one of the fundamental NP-hard problems. We take a widely used branch and bound algorithm for the maximum clique problem, and discuss an alternative way of understanding the algorithm which closely resembles a constraint model.
Ciaran McCreesh, Patrick Prosser
openaire   +2 more sources

A Branch-and-Bound Algorithm for the Talent Scheduling Problem

2014
The talent scheduling problem is a simplified version of the real-world film shooting problem, which aims to determine a shooting sequence so as to minimize the total cost of the actors involved. We devise a branch-and-bound algorithm to solve the problem.
Xiaocong Liang, Zizhen Zhang, Hu Qin, Songshan Guo, Andrew Lim 0001   +4 more
openaire   +2 more sources

The geometric branch-and-bound algorithm

2011
The aim of this chapter is the presentation of the fundamental geometric branch-and-bound algorithm including a general convergence theory. To this end, we start with a literature review of these approaches and their applications to facility location problems in Section 2.1.
openaire   +1 more source

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

European Journal of Operational Research, 2021
Pablo San Segundo Carrillo, Stefano Coniglio, Fabio Furini   +2 more
exaly  

A Branch-and-bound Algorithm For Array Distributions

Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing, 2005
Anne Dierstein, Roman Hayer, Thomas Rauber   +2 more
openaire   +1 more source

A Branch and Bound Algorithm for the Sequential Ordering Problem

2011
The Sequential Ordering Problem (SOP) is the problem of finding the shortest hamiltonian path in a graph while satisfying given precedence constraints regarding the order in which the nodes are visited. This classical optimization problem has many real-world applications, particularly in production planning, scheduling and transportation.
Karan, Mladen, Skorin-Kapov, Nina
openaire   +2 more sources

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

Journal of Manufacturing Systems, 2001
Wei-Chang Yeh
exaly  

A branch-and-bound algorithm for 0–1 parametric mixed integer programming

Operations Research Letters, 1985
Naonori Nishida
exaly  

A fast branch, bound and remember algorithm for disassembly line balancing problem

International Journal of Production Research, 2020
Ibrahim Kucukkoc, Suleyman Mete, Zeynel Abidin Cil   +2 more
exaly  

An improved branch and bound algorithm for feature selection

Pattern Recognition Letters, 2003
Xue-Wen Chen
exaly