Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
From MaRDI portal
Publication:3833848
Recommendations
- How to compute least infeasible flows
- A new algorithm for solving the feasibility problem of a network flow
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
- scientific article; zbMATH DE number 5173820
- A new strongly polynomial dual network simplex algorithm
- scientific article; zbMATH DE number 3850794
- scientific article; zbMATH DE number 42283
- A unified framework for primal-dual methods in minimum cost network flow problems
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- scientific article; zbMATH DE number 4064732
Cited in
(13)- Diagnosing infeasibilities in network flow problems
- MINOS(IIS): Infeasibility analysis using MINOS
- How to compute least infeasible flows
- Consistency, redundancy, and implied equalities in linear systems
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- The ANALYZE rulebase for supporting LP analysis
- Analyzing infeasible flow networks
- Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
- A characterization of irreducible infeasible subsystems in flow networks
- Localizing and Diagnosing Infeasibilities in Networks
- A new algorithm for solving the feasibility problem of a network flow
This page was built for publication: Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833848)
