Results 41 to 50 of about 976,293 (195)
The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3.
A. Bjorklund +9 more
core +1 more source
Efficient Algorithms for Moral Lineage Tracing
Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al.
Andres, Bjoern +6 more
core +1 more source
In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequencedependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching ...
Willy Alves de Oliveira +1 more
doaj +1 more source
We generalize the result of our recent paper on the massless single off-shell scalar box integral to the case of two non-adjacent end points off the light cone.
Juliane Haug, Fabian Wunder
doaj +1 more source
Research on topological structure and simulation of hybrid DC circuit breaker
At present, the hybrid DC circuit breaker (ABB company's Hybrid DC circuit breaker as the representative scheme) must be equipped with the radiator because of a long-time current passing through the power electronic devices in the load-control-switch ...
Chu Zhuang +3 more
doaj +1 more source
Probing the singularities of the Landau-Gauge gluon and ghost propagators with rational approximants
We employ Padé approximants in the study of the analytic structure of the four-dimensional SU(2) Landau-gauge gluon and ghost propagators in the infrared regime.
D. Boito +3 more
doaj +1 more source
Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops a computationally efficient algorithm to solve open pit production scheduling problems under uncertain ...
Devendra Joshi +3 more
doaj +1 more source
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions [PDF]
On hypergraphs with m hyperedges and n vertices, where p denotes the total size of the hyperedges, we provide the following results: We give an algorithm that runs in \
Kyle Fox, Debmalya Panigrahi, Fred Zhang
openaire +1 more source
Bent branches are commonly utilized in cut roses to enhance commercial flower quality through increased nutrient production and biomass. However, the ideal number of bent branches concerning crop water productivity remains unknown.
Xuanpeng Yin +8 more
doaj +1 more source
Location-Routing Problem of Emergency Facilities under Uncertain Demand by Branch-Price and Cut
This paper studies the location-routing problem of emergency facilities with time window under demand uncertainty. We propose a robust mathematical model in which uncertain requirements are represented by two forms: the support set defined by cardinal ...
Xuchen Deng
doaj +1 more source

