Integral Extreme Points
From MaRDI portal
Publication:5545992
Cited in
(24)- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
- Box-total dual integrality, box-integrality, and equimodular matrices
- Polynomial algorithms for a class of linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- From finite vector field data to combinatorial dynamical systems in the sense of Forman
- Analyzing fractional Horn constraint systems
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- Linear programs for constraint satisfaction problems
- Network tomography for integer-valued traffic
- \(k\)-integrality, an extension of total unimodularity
- Integer programs for logic constraint satisfaction
- Rational and integral \(k\)-regular matrices.
- Some classes of integral matrices
- A note on the total unimodularity of matrices
- Local unimodularity of matrix-vector pairs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Complement total unimodularity
- The multicommodity assignment problem: A network aggregation heuristic
- Total unimodularity and the Euler-subgraph problem
- Discrete extremal problems
- Testing additive integrality gaps
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- Minimum power partial multi-cover on a line
- On total \(f\)-domination: polyhedral and algorithmic results
This page was built for publication: Integral Extreme Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545992)
