Dyadic linear programming and extensions
From MaRDI portal
Cites work
- \(p\)-adic numbers: An introduction.
- A geometric inequality with applications to linear forms
- An integer analogue of Carathéodory's theorem
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Carathéodory bounds for integer cones
- Clean clutters and dyadic fractional packings
- Combinatorial optimization. Packing and covering
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational Complexity
- Finding an interior point in the optimal face of linear programs
- scientific article; zbMATH DE number 3158856 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 637070 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- scientific article; zbMATH DE number 1859212 (Why is no real title available?)
- Integer Programming
- On dyadic fractional packings of T-joins
- On Finding Primal- and Dual-Optimal Bases
- On Siegel's lemma
- On two minimax theorems in graph
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Résolution d'une question relative aux déterminants.
- Sparse Solutions of Linear Diophantine Equations
- Total dual dyadicness and dyadic generating sets
- Total dual dyadicness and dyadic generating sets
- Total dual integrality and integer polyhedra
Cited in
(3)
This page was built for publication: Dyadic linear programming and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932185)
