Integral infeasibility and testing total dual integrality
DOI10.1016/0167-6377(91)90084-3zbMATH Open0722.90057OpenAlexW2093283678MaRDI QIDQ757248FDOQ757248
Authors: David Applegate, William Cook, S. Thomas McCormick 
Publication date: 1991
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90084-3
Recommendations
- Alternatives for testing total dual integrality
- A polynomial-time test for total dual integrality in fixed dimension
- Intractability results for integration and discrepancy
- Characterizations of Total Dual Integrality
- scientific article; zbMATH DE number 3885657
- Total dual integrality of the linear complementarity problem
- Total dual integrality and integral solutions of the linear complementarity problem
- An intractability result for multiple integration
- On Testing Integrability
- On totally dual integral systems
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear systems in control theory (93C05)
Cites Work
- Title not available (Why is that?)
- Matching theory
- Title not available (Why is that?)
- Integer Programming with a Fixed Number of Variables
- Title not available (Why is that?)
- A Minimax Theorem for Directed Graphs
- Finding feasible vectors of Edmonds-Giles polyhedra
- A polynomial-time test for total dual integrality in fixed dimension
- Title not available (Why is that?)
- Total dual integrality and integer polyhedra
- A generalization of max flow—min cut
- Polynomial Algorithms for Totally Dual Integral Systems and Extensions
- Total weak unimodularity: Testing and applications
Cited In (7)
- Ranking tournaments with no errors. II: Minimax relation
- Ranking tournaments with no errors. I: Structural description
- A primal-dual algorithm for weighted abstract cut packing
- Counting as integration in feasible analysis
- A polynomial-time test for total dual integrality in fixed dimension
- On the integral dicycle packings and covers and the linear ordering polytope
- Alternatives for testing total dual integrality
This page was built for publication: Integral infeasibility and testing total dual integrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757248)
