Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2018.02.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2793983615
@@ Property / OpenAlex ID: W2793983615 / rank @@
+Normal rank
@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3760497
@@ Property / cites work: Q3760497 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results concerning post-infeasibility analysis
+Normal rank
@@ Property / cites work @@
+An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
+Normal rank
@@ Property / cites work @@
+Fast Heuristics for the Maximum Feasible Subsystem Problem
+Normal rank
@@ Property / cites work @@
+Feasibility and infeasibility in optimization. Algorithms and computational methods.
+Normal rank
@@ Property / cites work @@
+The minimum shift design problem
@@ Property / cites work: The minimum shift design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on flows in networks
@@ Property / cites work: A theorem on flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying Minimally Infeasible Subsystems of Inequalities
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
+Normal rank
@@ Property / cites work @@
+Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
+Normal rank
@@ Property / cites work @@
+Consistency, redundancy, and implied equalities in linear systems
+Normal rank
@@ Property / cites work @@
+Q3274170
@@ Property / cites work: Q3274170 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2827273
@@ Property / cites work: Q2827273 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of irreducible infeasible subsystems in flow networks
+Normal rank
@@ Property / cites work @@
+Evaluating Gas Network Capacities
@@ Property / cites work: Evaluating Gas Network Capacities / rank @@
+Normal rank
@@ Property / cites work @@
+On Algorithms for Enumerating All Circuits of a Graph
+Normal rank
@@ Property / cites work @@
+How to compute least infeasible flows
@@ Property / cites work: How to compute least infeasible flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the minimum weight IIS cover of an infeasible system of linear inequalities
+Normal rank
@@ Property / cites work @@
+Branch-and-Cut for the Maximum Feasible Subsystem Problem
+Normal rank
@@ Property / cites work @@
+A note on resolving infeasibility in linear programs by constraint relaxation
+Normal rank
@@ Property / cites work @@
+A search strategy for the elementary cycles of a directed graph
+Normal rank
@@ Property / cites work @@
+The facets of the polyhedral set determined by the Gale-Hoffman inequalities
+Normal rank