Results 41 to 50 of about 141,288 (266)
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
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +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
Geriatric Orthopaedic Surgery & Rehabilitation, 2022 Introduction Arterial injury following total knee arthroplasty (TKA) can be life-threatening. There are some anatomical variations in the popliteal artery (PA) and its branches.
Yuya Kimura MD +3 more
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
Branch and cut methods for network optimization
Mathematical and Computer Modelling, 2001 This paper contains a survey on the use of the Branch and Cut technique for solving network related combinatorial optimization problems. After an introductory section, a description in general terms is given of the Branch and Cut methodology and of the ``separation problem'', including also a discussion on advantages and disadvantages of the technique.
Caccetta, L., Hill, S. P.
openaire +2 more sources
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 +4 more sources
AAA+ protein unfoldases—the Moirai of the proteome
FEBS Letters, EarlyView.AAA+ unfoldases are essential molecular motors that power protein degradation and disaggregation. This review integrates recent cryo‐electron microscopy (cryo‐EM) structures and single‐molecule biophysical data to reconcile competing models of substrate translocation.
Stavros Azinas, Marta Carroni
wiley +1 more source
Integrated Crew Scheduling and Roster Problem for Trainmasters of Passenger Railway Transportation
IEEE Access, 2019 Train crew management is an imperative task in a passenger railway system and is typically decomposed into two sub-problems: crew scheduling problem and crew rostering problem.
Dung-Ying Lin, Meng-Rung Tsai
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