Results 11 to 20 of about 140,088 (167)
A Wheeler–DeWitt Non-Commutative Quantum Approach to the Branch-Cut Gravity
Universe, 2023 In this contribution, motivated by the quest to understand cosmic acceleration, based on the theory of Hořava–Lifshitz and on the branch-cut gravitation, we investigate the effects of non-commutativity of a mini-superspace of variables obeying the ...
Benno Bodmann +8 more
doaj +1 more source
IEEE Access, 2021 The study focuses on the strategic decisions including on the location and capacity of stations and the fleet size for designing the one-way station-based carsharing systems. Under demand uncertainty, we introduce a two-stage risk-averse stochastic model
Kai Zhang +3 more
doaj +1 more source
An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
International Journal of Production Management and Engineering, 2017 In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. For achieving this purpose, a historical perspective of the development of enumeration methods in the field of bi-level linear programming is considered ...
Arsalan Rahmani, Majid Yousefikhoshbakht
doaj +1 more source
Frontiers in Medicine, 2022 ObjectiveTo determine the optimal ultrasound (US) cut-off values for cranial and extracranial arteries intima media thickness (IMT) to discriminate between patients with and without giant cell arteritis (GCA).MethodsRetrospective observational study ...
Katerine López-Gloria +19 more
doaj +1 more source
Journal of High Energy Physics, 2023 The Coon amplitude is a q-deformed generalization of the Veneziano amplitude exhibiting a semi-infinite sequence of poles that converge on an accumulation point, from which a branch cut emerges. A number of recent papers have provided compelling evidence
Christian Baadsgaard Jepsen
doaj +1 more source
A branch‐and‐cut algorithm for partition coloring [PDF]
Networks, 2009 AbstractLet G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1,…,Qq} is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the partition. The partition coloring problem (PCP) consists of finding a subset V′ of V with exactly one vertex from each component Q1,…,Qq and such that ...
Frota, Yuri +3 more
openaire +1 more source
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
IEEE Access, 2013 The multilevel generalized assignment problem (MGAP) consists of minimizing the assignment cost of a set of jobs to machines, each having associated therewith a capacity constraint.
Pasquale Avella +2 more
doaj +1 more source
EURO Journal on Computational Optimization, 2013 We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP.
Mounira Groiez +3 more
doaj +1 more source
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