Results 81 to 90 of about 14,097 (243)
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
, 2022 Mixed integer linear programming is a combinatorial optimization problem that is difficult to solve efficiently. One method that can be used to solve mixed integer linear programming problems is the branch and bound and branch and cut methods.
Beruh, Maharani
core
ADP‐ribosylation: An emerging regulator of the epigenome
Molecular Oncology, EarlyView.ADP‐ribosylation has emerged as a dynamic epigenetic signaling mechanism that modifies histones and chromatin‐associated proteins. Through coordinated PARylation and MARylation, it integrates with other histone modifications to regulate chromatin structure, transcription factor activity, and gene expression, influencing genome function and disease ...
Cristel V. Camacho +2 more
wiley +1 more source
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source
Engineering Branch-and-Cut Algorithms for the Equicut Problem [PDF]
, 2013 A minimum equicut of an edge-weighted graph is a partition of the nodes of the graph into two sets of equal size such that the sum of the weights of edges joining nodes in different partitions is minimum. We compare basic linear and semidefinite relaxations for the equicut problem, and find that linear bounds are competitive with the corresponding ...
Anjos, Miguel F. +3 more
openaire +2 more sources
A branch-and-cut algorithm for an assembly routing problem
European Journal of Operational Research, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masoud Chitsaz +2 more
openaire +5 more sources
Molecular Oncology, EarlyView.Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez +5 more
wiley +1 more source
Molecular Oncology, EarlyView.Isocitrate dehydrogenase 1 (IDH1) mutations are highly recurrent in multiple human cancer types, including cholangiocarcinoma and glioma. IDH1 R132C is the most common IDH1 mutation in cholangiocarcinoma and likely arises from APOBEC3A‐ or APOBEC3B‐mediated deamination.
Kelly E. Butler +3 more
wiley +1 more source
Solving real-world ATSP instances by branch-and-cut
, 2003 Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes.
Fischetti M., Lodi A., Toth P.
core +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source