Integer programs with nearly totally unimodular matrices: the cographic case

Documenti analoghi

• Integer programs with bounded subdeterminants and two nonzeros per row
  di: Fiorini, Samuel, et al.
  Pubblicazione: (2021)
• Total Matching and Subdeterminants
  di: Ferrarini, Luca, et al.
  Pubblicazione: (2023)
• Totally $Δ$-modular IPs with two non-zeros in most rows
  di: Kober, Stefan
  Pubblicazione: (2024)
• Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
  di: Schade, Jamico, et al.
  Pubblicazione: (2023)
• Face covers and rooted minors in bounded genus graphs
  di: Fiorini, Samuel, et al.
  Pubblicazione: (2025)