Results 271 to 280 of about 35,838 (299)
Some of the next articles are maybe not open access.
A branch and bound algorithm for quantified quadratic programming
Journal of Global Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferenc Domes, Alexandre Goldsztejn
openaire +2 more sources
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM, 1977A dominance relation D is a binary relation defined on the set of partial problems generated in a branch-and-bound algorithm, such that P i DP j (where P i ...
openaire +3 more sources
A Branch-and-Bound Algorithm for the Talent Scheduling Problem
2014The 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 +4 more
openaire +2 more sources
Depth-m search in branch-and-bound algorithms
International Journal of Computer & Information Sciences, 1978A new search strategy, called depth-m search, is proposed for branch-and-bound algorithms, wherem is a parameter to be set by the user. In particular, depth-1 search is equivalent to the conventional depth-first search, and depth-∞ search is equivalent to the general heuristic search (including best-bound search as a special case).
openaire +3 more sources
A Parallel Branch and Bound Algorithm for the Probabilistic TSP
2018The paper presents parallelization of exact algorithm of resolution for the Probabilistic Traveling Salesman Problem (PTSP). This algorithm allows us, first, to verify the stability of well-solvable special cases and also to optimally solve useful instances of PTSP.
Mohamed Abdellahi Amar +2 more
openaire +2 more sources
The geometric branch-and-bound algorithm
2011The 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 Branch and Bound Algorithm for the Sequential Ordering Problem
2011The 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
A Branch-and-bound Algorithm For Array Distributions
Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing, 2005Anne Dierstein +2 more
openaire +1 more source
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021Pablo San Segundo Carrillo +2 more
exaly
Quantum Relaxation Based Branch-and-Bound Algorithm
2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023Wei-Hao Huang +3 more
openaire +2 more sources