# Finding weakly reversible realizations of chemical reaction networks using optimization

Source: [Finding weakly reversible realizations of chemical reaction networks using optimization](<https://www.sota2.com/research/paper/68fa4f371e209131ce961d78>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T10:12:48.492Z

Authors: Gabor Szederkenyi, Katalin M. Hangos, Zsolt Tuza

Published: 2011-03-24T11:56:00.000Z

## Abstract

An algorithm is given in this paper for the computation of dynamically equivalent weakly reversible realizations with the maximal number of reactions, for chemical reaction networks (CRNs) with mass action kinetics. The original problem statement can be traced back at least 30 years ago. The algorithm uses standard linear and mixed integer linear programming, and it is based on elementary graph theory and important former results on the dense realizations of CRNs. The proposed method is also capable of determining if no dynamically equivalent weakly reversible structure exists for a given reaction network with a previously fixed complex set.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1103.4741>)

[PDF](<https://arxiv.org/pdf/1103.4741.pdf>)