Results 31 to 40 of about 140,088 (167)
Trends in Computational and Applied Mathematics, 2018 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
Journal of High Energy Physics, 2023 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
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
Research on topological structure and simulation of hybrid DC circuit breaker
The Journal of Engineering, 2019 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
Journal of High Energy Physics, 2023 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
BDDs in a Branch and Cut Framework [PDF]
, 2005 Branch & Cut is today's state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1-IPs and thus allow for early pruning of parts of the search tree.
Becker, Bernd +3 more
openaire +3 more sources
Mining, 2022 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
Agricultural Water ManagementBent 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
Journal of Mathematics, 2021 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
Dynamic Three-Dimensional Surface Reconstruction Approach for Continuously Deformed Objects
IEEE Photonics Journal, 2021 For dynamic three-dimensional (3-D) surface reconstruction of continuously deformed objects, an efficient method employing one fringe pattern is proposed.
Jianhua Wang, Yanxi Yang, Yuguo Zhou
doaj +1 more source