Extended formulations of lower-truncated transversal polymatroids
From MaRDI portal
Publication:4999331
Recommendations
Cites work
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- Combinatorial bounds on nonnegative rank and extended formulations
- Connections in combinatorial optimization
- Extended formulations for sparsity matroids
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- Natural realizations of sparsity matroids
- On combinatorial structures of line drawings of polyhedra
- Rado's theorem for polymatroids
- Some \(0/1\) polytopes need exponential size extended formulations
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(4)
This page was built for publication: Extended formulations of lower-truncated transversal polymatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999331)