Cargando…
Strengthening convex relaxations of 0/1-sets using Boolean formulas
In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popul...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550646/ https://www.ncbi.nlm.nih.gov/pubmed/34776534 http://dx.doi.org/10.1007/s10107-020-01542-w |