Extended Formulation Lower Bounds via Hypergraph Coloring
From MaRDI portal
Publication:2955024
DOI10.4230/LIPIcs.STACS.2015.568zbMath1355.68287arXiv1410.1150OpenAlexW2963382727MaRDI QIDQ2955024
Yannis Moysoglou, Stavros G. Kolliopoulos
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1410.1150
Nonnumerical algorithms (68W05) Linear programming (90C05) Hypergraphs (05C65) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Extended Formulation Lower Bounds via Hypergraph Coloring