Results 21 to 30 of about 976,293 (195)
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
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
An exact method for a discrete multiobjective linear fractional optimization [PDF]
, 2007 Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core +2 more sources
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
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
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem [PDF]
, 2016 This paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known.
Dalmeijer, K. (Kevin), Spliet, R. (Remy)
core +2 more sources
Poles and Branch Cuts in Free Surface Hydrodynamics [PDF]
Water Waves, 2020 We consider the motion of ideal incompressible fluid with free surface. We analyzed the exact fluid dynamics though the time-dependent conformal mapping $z=x+iy=z(w,t)$ of the lower complex half plane of the conformal variable $w$ into the area occupied by fluid. We established the exact results on the existence vs.
P. M. Lushnikov, V. E. Zakharov
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
A novel implementation of discrete complex image method for layered medium Green's function [PDF]
, 2011 A novel implementation of discrete complex image method (DCIM) based on the Sommmerfeld branch cut is proposed to accurately capture the far-field behavior of the layered medium Green's function as a complement to the traditional DCIM.
Chen, YP, Chew, WC, Jiang, L
core +2 more sources
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