Extended formulations of lower-truncated transversal polymatroids
DOI10.1080/10556788.2020.1769619zbMATH Open1467.05028OpenAlexW3038398098MaRDI QIDQ4999331FDOQ4999331
Hideki Imai, Keiko Imai, Hidefumi Hiraishi
Publication date: 6 July 2021
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2020.1769619
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- On combinatorial structures of line drawings of polyhedra
- Combinatorial bounds on nonnegative rank and extended formulations
- The Matching Polytope has Exponential Extension Complexity
- Using separation algorithms to generate mixed integer model reformulations
- Some \(0/1\) polytopes need exponential size extended formulations
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- Extended formulations for sparsity matroids
- Natural realizations of sparsity matroids
- Extended formulations, nonnegative factorizations, and randomized communication protocols
- Rado's theorem for polymatroids
- Title not available (Why is that?)
Cited In (1)
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)
