Results 61 to 70 of about 141,288 (266)

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., Liers, Frauke, Pardella, Gregor, Schmutzer, Andreas   +3 more
openaire   +3 more sources

C2α‐carbanion‐protonating glutamate discloses tradeoffs between substrate accommodation and reaction rate in actinobacterial 2‐hydroxyacyl‐CoA lyase

FEBS Open Bio, EarlyView.
Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn, Barbara Seroka, Ryszard Lazny, Zenon Lotowski, Thore Rohwerder   +4 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

A branch-and-cut algorithm for multiple sequence alignment

Proceedings of the first annual international conference on Computational molecular biology - RECOMB '97, 1997
We consider a branch-and-cut approach for solving the multiple sequence alignment problem, which is a central problem in computational biology. We propose a general model for this problem in which arbitrary gap costs are allowed. An interesting aspect of our approach is that the three (exponentially large) classes of natural valid inequalities that we ...
Reinert, K., Lenhof, H., Mutzel, P., Mehlhorn, K., Kececioglou, J.   +4 more
openaire   +3 more sources

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

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, Fredrik Orädd, Konstantinos Magkakis, Magnus Andersson   +3 more
wiley   +1 more source

Rearrangement of DNA fragments: a branch-and-cut algorithm

Discrete Applied Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferreira, C.E., de Souza, C.C., Wakabayashi, Y.   +2 more
openaire   +2 more sources

Matrix metalloproteinase‐9 regulates cell adhesion and membrane protrusive activity of ovarian cancer cells

FEBS Open Bio, EarlyView.
Matrix metalloproteinase‐9 (MMP9) drives ovarian cancer progression. Using MMP9‐null cells (M9‐KO) created from ovarian cancer cells, we found MMP9 loss did not block Epidermal Growth Factor (EGF)‐driven E‐cadherin dissolution or EMT but delayed and reduced EGF‐driven membrane protrusions. Transient MMP9 re‐expression drove membrane protrusion.
Claire Strauel, Sam Bennett, Natalie Ehlinger, Nelson Cook, Katelyn Marvin, Caleb L. Lines, Sam Reyes, Brooke Kirby, Shawn M. Ellerbroek   +8 more
wiley   +1 more source

Digital twins to accelerate target identification and drug development for immune‐mediated disorders

FEBS Open Bio, EarlyView.
Digital twins integrate patient‐derived molecular and clinical data into personalised computational models that simulate disease mechanisms. They enable rapid identification and validation of therapeutic targets, prediction of drug responses, and prioritisation of candidate interventions.
Anna Niarakis, Philippe Moingeon
wiley   +1 more source

Branch-and-Cut Algorithms for Colorful Components Problems

INFORMS Journal on Computing
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one.
Claudia Archetti, Martina Cerulli, Carmine Sorgente   +2 more
openaire   +2 more sources

Learning to Configure Separators in Branch-and-Cut

, 2023
Cutting planes are crucial in solving mixed integer linear programs (MILP) as they facilitate bound improvements on the optimal solution. Modern MILP solvers rely on a variety of separators to generate a diverse set of cutting planes by invoking the separators frequently during the solving process.
Li, Sirui, Ouyang, Wenbin, Paulus, Max B., Wu, Cathy   +3 more
openaire   +2 more sources