Results 21 to 30 of about 143,487 (265)
A branch‐and‐cut algorithm for the Team Orienteering Problem [PDF]
International Transactions in Operational Research, 2017 AbstractThe Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed.
Bianchessi, Nicola +2 more
openaire +3 more sources
Beech shearing/high-stumping to control understory interference
The Forestry Chronicle, 2017 The research evaluated opportunities for cutting off small understory beech root suckers at 0.6-0.9 m above ground. By six years (pilot test) after cutting with lopping shears in a closed-canopy uneven-aged northern hardwood stand, 91% of high stumps ...
Ralph D. Nyland, Diane H. Kiernan
doaj +1 more source
An exact algorithm for design of content delivery networks in MPLS environment
Journal of Telecommunications and Information Technology, 2004 Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques.
Krzysztof Walkowiak
doaj +1 more source
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
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP [PDF]
RAIRO - Operations Research, 2018 In this article, we address the preemptive Resource-Constrained Precedence Scheduling Problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise incomparable elements with respect to the precedence constraints.
Fouilhoux, Pierre +3 more
openaire +2 more sources
A Branch-and-Cut Algorithm for Submodular Interdiction Games
INFORMS Journal on Computing, 2022 Many relevant applications from diverse areas such as marketing, wildlife conservation, and defending critical infrastructure can be modeled as interdiction games. In this work, we introduce interdiction games whose objective is a monotone and submodular set function.
Kübra Taninmis, Markus Sinnl
openaire +2 more sources
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
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
Pruning by Isomorphism in Branch-and-Cut
Mathematical Programming, 2001 The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating cuts. The cuts are non-standard, cutting integer feasible solutions but leaving the optimal value of the problem unchanged.
openaire +2 more sources