Total dual dyadicness and dyadic generating sets
From MaRDI portal
Publication:6589746
DOI10.1007/s10107-023-01967-zMaRDI QIDQ6589746
Bertrand Guenin, Gérard Cornuéjols, Levent Tunçel, Ahmad Abdi
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing conic TDI systems is hard
- Total dual integrality and integer polyhedra
- Smith normal form in combinatorics
- Shortest coverings of graphs with cycles
- The complexity of recognizing linear systems with certain integrality properties
- Matching structure and the matching lattice
- Subspaces with well-scaled frames
- Matroids and multicommodity flows
- Rational and integral \(k\)-regular matrices.
- House of Graphs: a database of interesting graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A characterisation of the matroids representable over GF(3) and the rationals
- Cuboids, a class of clutters
- Combinatorial optimization. Packing and covering
- An Exact Rational Mixed-Integer Programming Solver
- Integer Programming
- Total dual integrality implies local strong unimodularity
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Graphs with the Circuit Cover Property
- On Dyadic Fractional Packings of $T$-Joins
- Clean Clutters and Dyadic Fractional Packings
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Total dual dyadicness and dyadic generating sets
