Cargando…
Complexity of linear relaxations in integer programming
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity [Formula: see text] . This parameter, introduced by Kaibel & Weltge (2015), captures the complexity of linear descriptio...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9237013/ https://www.ncbi.nlm.nih.gov/pubmed/35782488 http://dx.doi.org/10.1007/s10107-021-01623-4 |