Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012543710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING ALL SPARSE KINETIC STRUCTURES FOR A LORENZ SYSTEM USING OPTIMIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3654592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sparse and dense realizations of reaction kinetic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding complex balanced and detailed balanced realizations of chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundedness of trajectories for weakly reversible, single linkage class reaction systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear conjugacy of chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of the positive steady states of weakly reversible deficiency-one mass action systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical Equivalence and Linear Conjugacy of Chemical Reaction Networks: New Results and Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4740388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and analysis of mass-action kinetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005. / rank
 
Normal rank

Latest revision as of 15:48, 8 July 2024

scientific article
Language Label Description Also known as
English
Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
scientific article

    Statements

    Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2014
    0 references
    0 references
    chemical reaction networks
    0 references
    weak reversibility
    0 references
    dynamical equivalence
    0 references
    linear conjugacy
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references