article · KiltHub Repository · 2018

Polyhedral Approaches to Mixed Integer Linear Programming

Conforti, Michele, Cornuejols, Gerard, Zambelli, Giacomo

Cited by 0Open access

Abstract

This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts.

Cite this paper

APA 7

Conforti, M., Cornuejols, G., & Zambelli, G. (2018). Polyhedral Approaches to Mixed Integer Linear Programming. KiltHub Repository. https://doi.org/10.1184/r1/6707402

MLA 9

Conforti, Michele, et al. “Polyhedral Approaches to Mixed Integer Linear Programming.” KiltHub Repository, 2018, https://doi.org/10.1184/r1/6707402.

Chicago

Conforti, Michele, Gerard Cornuejols, and Giacomo Zambelli. 2018. “Polyhedral Approaches to Mixed Integer Linear Programming.” KiltHub Repository. https://doi.org/10.1184/r1/6707402.

Harvard

Conforti, M., Cornuejols, G. and Zambelli, G. (2018) ‘Polyhedral Approaches to Mixed Integer Linear Programming’, KiltHub Repository. Available at: https://doi.org/10.1184/r1/6707402.

BibTeX

@article{conforti2018polyhedral,
  title = {{Polyhedral Approaches to Mixed Integer Linear Programming}},
  author = {Conforti, Michele and Cornuejols, Gerard and Zambelli, Giacomo},
  journal = {KiltHub Repository},
  year = {2018},
  doi = {10.1184/r1/6707402}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.