Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
From MaRDI portal
Recommendations
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
- Diagnosing infeasibilities in network flow problems
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- scientific article; zbMATH DE number 795215
- A unified framework for primal-dual methods in minimum cost network flow problems
- scientific article; zbMATH DE number 3876888
- A polynomial time primal network simplex algorithm for minimum cost flows
- The problem of minimum cost flow in undirected networks: optimality conditions and analysis of alternative formulations
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
Cited in
(8)- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Diagnosing infeasibilities in network flow problems
- How to compute least infeasible flows
- Consistency, redundancy, and implied equalities in linear systems
- The facets of the polyhedral set determined by the Gale-Hoffman inequalities
- Localizing and Diagnosing Infeasibilities in Networks
- The ANALYZE rulebase for supporting LP analysis
This page was built for publication: Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035117)
