Abdi, Ahmad ORCID: 0000-0002-3008-4167, Cornuéjols, Gérard, Guenin, Bertrand and Tunçel, Levent (2022) Total dual dyadicness and dyadic generating sets. In: Aardal, Karen and Sanità, Laura, (eds.) Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings: book series. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),13265. Springer Science and Business Media Deutschland GmbH, pp. 1-14. ISBN 9783031069000
Text (IPCO_version)
- Accepted Version
Download (469kB) |
|
Text (Total dual dyadicness and dyadic generating sets)
- Accepted Version
Download (317kB) |
Abstract
A vector is dyadic if each of its entries is a dyadic rational number, i.e. of the form a2k for some integers a, k with k≥ 0. A linear system Ax≤ b with integral data is totally dual dyadic if whenever min { b⊤y: A⊤y= w, y≥ 0} for w integral, has an optimal solution, it has a dyadic optimal solution. In this paper, we study total dual dyadicness, and give a co-NP characterization of it in terms of dyadic generating sets for cones and subspaces, the former being the dyadic analogue of Hilbert bases, and the latter a polynomial-time recognizable relaxation of the former. Along the way, we see some surprising turn of events when compared to total dual integrality, primarily led by the density of the dyadic rationals. Our study ultimately leads to a better understanding of total dual integrality and polyhedral integrality. We see examples from dyadic matrices, T-joins, circuits, and perfect matchings of a graph.
Item Type: | Book Section |
---|---|
Official URL: | https://link.springer.com/book/10.1007/978-3-031-0... |
Additional Information: | © 2022 Springer Nature Switzerland AG. |
Divisions: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Date Deposited: | 22 Jul 2022 15:42 |
Last Modified: | 20 Dec 2024 00:19 |
URI: | http://eprints.lse.ac.uk/id/eprint/115635 |
Actions (login required)
View Item |