A Characterization of Irreducible Infeasible Subsystems in Flow Networks

Networks - United States
doi 10.1002/net.21686
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

A Characterization of Finitely Irreducible Continua

Colloquium Mathematicum
Mathematics
1988English

A Structural Geometrical Analysis of Weakly Infeasible SDPS

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2016English

Joogie: Infeasible Code Detection for Java

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Logic for Knowledge Flow in Social Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Novel Characterization of Amalgamated Networks in Natural Systems

Scientific Reports
Multidisciplinary
2015English

Irreducible Quotients of A-Hypergeometric Systems

Compositio Mathematica
Number TheoryAlgebra
2010English

A Note on Polylinking Flow Networks

Mathematical Programming, Series B
MathematicsSoftware
2011English

Vague Terms: Contracting When Precision in Terms Is Infeasible

Journal of Institutional and Theoretical Economics
EconomicsEconometrics
2008English

Maximum Flow in Planar Networks

SIAM Journal on Computing
MathematicsComputer Science
1979English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy