Results 1  10
of
233
Computing minimal nutrient sets from metabolic networks via linear constraint solving
, 2013
"... ..."
On the computation of minimal cut sets in genome scale metabolic networks
 Amer. Contr. Conf
"... AbstractA cut set for an objective reaction in a metabolic network is a set of reactions whose knockout disables flux through that reaction at steady state. Cut sets represent a particular type of failure mode of a metabolic network and may correspond to novel drug targets. In this paper, we demon ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
demonstrate how cut sets can be obtained from the computation of subElementary Modes (subEM). The subEM's of a metabolic network are the Elementary Modes (EM) of a submatrix of the stoichiometry matrix formed by taking a subset of its rows. SubEM's emerge naturally in the intermediate steps
A characterization of convex problems in decentralized control
 IEEE Transactions on Automatic Control
"... Abstract—We consider the problem of constructing optimal decentralized controllers. We formulate this problem as one of minimizing the closedloop norm of a feedback system subject to constraints on the controller structure. We define the notion of quadratic invariance of a constraint set with respe ..."
Abstract

Cited by 133 (24 self)
 Add to MetaCart
with respect to a system, and show that if the constraint set has this property, then the constrained minimumnorm problem may be solved via convex programming. We also show that quadratic invariance is necessary and sufficient for the constraint set to be preserved under feedback. These results are developed
Feature Selection via Mathematical Programming
, 1997
"... The problem of discriminating between two finite point sets in ndimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a mathematical program with a parametric objective function and linear constraints. The step function that appears in th ..."
Abstract

Cited by 72 (23 self)
 Add to MetaCart
The problem of discriminating between two finite point sets in ndimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a mathematical program with a parametric objective function and linear constraints. The step function that appears
Information Dissemination in Networks via Linear Iterative Strategies Over Finite Fields
"... Abstract — Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only process and communicate values in that set. To solve this problem, ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract — Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only process and communicate values in that set. To solve this problem
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming
"... Abstract. We study the problem of selecting the minimum tiling path (MTP) from a set of clones arranged in a physical map. We formulate the constraints of the MTP problem in a graph theoretical framework, and we derive an optimization problem that is solved via integer linear programming. Experiment ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. We study the problem of selecting the minimum tiling path (MTP) from a set of clones arranged in a physical map. We formulate the constraints of the MTP problem in a graph theoretical framework, and we derive an optimization problem that is solved via integer linear programming
What is flux balance analysis?
 Nat Biotech,
, 2010
"... matrix of stoichiometriesthat consumes precursor metabolites at stoichiometries that simulate biomass production. The biomass reaction is based on experimental measurements of biomass components. This reaction is scaled so that the flux through it is equal to the exponential growth rate (µ) of the ..."
Abstract

Cited by 93 (8 self)
 Add to MetaCart
, an 'objective function' is used to quantitatively define how much each reaction contributes to the phenotype. Taken together, the mathematical representations of the metabolic reactions and of the objective define a system of linear equations. In flux balance analysis, these equations are solved
MultiConstrained Optimal Path Selection
, 2001
"... Providing qualityofservice (QoS) guarantees in packet networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. The latter objective implies the need to impose an a ..."
Abstract

Cited by 80 (1 self)
 Add to MetaCart
Providing qualityofservice (QoS) guarantees in packet networks gives rise to several challenging issues. One of them is how to determine a feasible path that satisfies a set of constraints while maintaining high utilization of network resources. The latter objective implies the need to impose
Design of Optimal Water Distribution System
 Water Resources Research
, 1977
"... A method called linear programing gradient (LPG) is presented, by which the optimal design of a water distribution system can be obtained. The system is a pipeline network, which delivers known demands from sources to consumers and may contain pumps, valves, and reservoirs. Operation of the system u ..."
Abstract

Cited by 60 (0 self)
 Add to MetaCart
of the loading conditions. The objective function, to be minimized, reflects the overall cost capital plus present value of operating costs. The constraints are that demands are to be met and pressures at selected nodes in the network are to be within specilied limits. The solution is obtained via a hierarchial
Stochastic Network Interdiction.
 In Operations Research,
, 2008
"... Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when interdiction ..."
Abstract

Cited by 42 (7 self)
 Add to MetaCart
Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when
Results 1  10
of
233