report · QRU Quaderns de Recerca en Urbanisme · 1995

Resolution of NP-complete problems

Gavaldà Mestre, Ricard

Cited by 0Open access

Abstract

These are the course notes for my lectures on "Resolution of NP-complete problems". These lectures are a part of the Sixth Advanced Course on Artificial Intelligence, ACAI'95, which this year is devoted to AI Algorithmics, and will take place on June 29th-July 6th in Perros-Guirec (France). They survey on three basic paradigms for combinatorial optimization: heuristics, branch-and-cut, and approximation algorithms.

Cite this paper

APA 7

Gavaldà Mestre, R. (1995). Resolution of NP-complete problems. QRU Quaderns de Recerca en Urbanisme.

MLA 9

Gavaldà Mestre, Ricard. “Resolution of NP-complete problems.” QRU Quaderns de Recerca en Urbanisme, 1995.

Chicago

Gavaldà Mestre, Ricard. 1995. “Resolution of NP-complete problems.” QRU Quaderns de Recerca en Urbanisme.

Harvard

Gavaldà Mestre, R. (1995) ‘Resolution of NP-complete problems’, QRU Quaderns de Recerca en Urbanisme.

BibTeX

@article{gavaldamestre1995resolution,
  title = {{Resolution of NP-complete problems}},
  author = {Gavaldà Mestre, Ricard},
  journal = {QRU Quaderns de Recerca en Urbanisme},
  year = {1995}
}

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