Results 31 to 40 of about 14,097 (243)
Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment [PDF]
Компьютерные исследования и моделирование, 2015 The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and inter-process communication capabilities of Erlang.
S. A. Smirnov, V. V. Voloshinov
doaj +1 more source
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
Mathematics, 2021 We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job.
Nodari Vakhania, Frank Werner
doaj +1 more source
AlgorithmsMountainous forest-fire surveillance with multiple UAVs is constrained by rugged terrain, time-varying winds, and temperature-dependent battery derating, which jointly affect endurance and route feasibility.
Jun Zhang, Anxu Su, Bo Liu
doaj +1 more source
Branch-Cut Cosmology and the Bekenstein Criterion
, 2022 In this contribution we address the implications of the Bekenstein Criterion in the branch-cut cosmology. The impossibility of packaging energy and entropy according to the Bekenstein Criterion in a finite size makes the transition phase of the branch ...
Hadjimichef, Dimiter +9 more
core +1 more source
Journal of High Energy Physics, 2023 We investigate the single off-shell scalar box integral with massless internal lines in dimensional regularization. A special emphasis is given to higher orders in the dimensional regularization parameter epsilon, its branch cut structure, and kinematic ...
Juliane Haug, Fabian Wunder
doaj +1 more source
Fluids, 2019 A long overdue distinction between so-called variant and invariant complex potentials is proposed here for the first time. Invariant complex potentials describe physical flows where a switch of the real and imaginary parts of the function will still ...
Aadi Khanal, Ruud Weijermars
doaj +1 more source
The Independence Number Conditions for 2-Factors of a Claw-Free Graph
Axioms, 2022 In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs.
Wanpeng Lei, Liming Xiong, Jun Yin
doaj +1 more source
Improved Sample Complexity Bounds for Branch-and-Cut
, 2021 Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable parameters that have a huge impact on the size of the search tree that it builds, but are challenging to tune by hand.
Maria-Florina Balcan +3 more
openaire +4 more sources
Branch-and-Cut-and-Price for Multi-Agent Pathfinding [PDF]
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019 There are currently two broad strategies for optimal Multi-agent Pathfinding (MAPF): (1) search-based methods, which model and solve MAPF directly, and (2) compilation-based solvers, which reduce MAPF to instances of well-known combinatorial problems, and thus, can benefit from advances in solver techniques.
Edward Lam 0001 +3 more
openaire +3 more sources