Total dual dyadicness and dyadic generating sets

DOI10.1007/S10107-023-01967-ZMaRDI QIDQ6589746zbMATH OpenFDO

Authors Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel

Publication date 20 August 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear programmingtotal dual integralitydyadic rationaldyadic programmingtotal dual dyadicness

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)

Recommendations

• Total dual dyadicness and dyadic generating sets
• scientific article; zbMATH DE number 3885657
• On totally dual integral systems
• On box totally dual integral polyhedra
• Finitely generated dyadic convex sets

Cites work

• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 475604 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• A characterisation of the matroids representable over GF(3) and the rationals
• An exact rational mixed-integer programming solver
• Blocking and anti-blocking pairs of polyhedra
• Clean clutters and dyadic fractional packings
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cuboids, a class of clutters
• Graphs with the Circuit Cover Property
• House of Graphs: a database of interesting graphs
• Integer Programming
• Matching structure and the matching lattice
• Matroids and multicommodity flows
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On dyadic fractional packings of \(T\)-joins
• Polyhedral decompositions of cubic graphs
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Rational and integral \(k\)-regular matrices.
• Recognizing conic TDI systems is hard
• Shortest coverings of graphs with cycles
• Smith normal form in combinatorics
• Subspaces with well-scaled frames
• The complexity of recognizing linear systems with certain integrality properties
• Total dual integrality and integer polyhedra
• Total dual integrality implies local strong unimodularity

This page was built for publication: Total dual dyadicness and dyadic generating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589746)