Results 1 to 10 of about 204,066 (330)
THE RAY-METHOD: THEORETICAL BACKGROUND AND COMPUTATIONAL RESULTS
Croatian Operational Research Review, 2012 In our talk we present an algorithm for determining initial bound for the Branch and Bound (B&B) method. The idea of the algorithm is based on the use of the "ray" introduced in the "ray-method" developed for solving integer programming problems [13 ...
Erik Bajalinov, Anett Rácz
doaj
Where the really hard problems aren’t
Operations Research Perspectives, 2020 Not all problem instances in combinatorial optimization are equally hard. One famous study “Where the Really Hard Problems Are” shows that for three decision problems and one optimization problem, computational costs can vary dramatically for equally ...
Joeri Sleegers +3 more
doaj +1 more source
Branch-and-bound for bi-objective integer programming [PDF]
INFORMS journal on computing, 2018 In bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions.
Sophie N. Parragh, Fabien Tricoire
semanticscholar +1 more source
Acta Scientiarum: Technology, 2016 This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be
Felipe Borreiro Sanches +2 more
doaj +1 more source
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source
Exact Solutions for Minimizing cost Function with Five Criteria and Release Dates on Single Machine
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2020 In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates.
Hanan Ali Chachan +1 more
doaj +1 more source
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Discrete Optimization, 2016 The branch-and-bound (B&B) algorithmic framework has been used successfully to find exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to implicitly enumerate all possible solutions to a given problem, applying ...
D. Morrison +3 more
semanticscholar +1 more source
Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times
Mathematics, 2023 In this paper, we study a single-machine green scheduling problem with learning effects and past-sequence-dependent delivery times. The problem can be properly applied to tackle green manufacturing where production and delivery time are variable and ...
Hongyu He +5 more
doaj +1 more source
Performance analysis of Branch-and-Bound skeletons
Mathematical and Computer Modelling, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorta, I., León, C., Rodríguez, C.
openaire +2 more sources
Processor load balancing for parallel branch and bound algorithms
Lietuvos Matematikos Rinkinys, 2005 In this atricle the development of parallel branch and bound algorithm template is presented. Attention is ocused on the dynamic load balancing module of the template.
Milda Baravykaitė
doaj +3 more sources