Lancaster EPrints

The max-cut and max-clique problems: linear versus semidefinite programming

Letchford, Adam (2008) The max-cut and max-clique problems: linear versus semidefinite programming. In: CO 2008, 2008-01-01, Warwick.

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Journal or Publication Title: CO 2008
Subjects: H Social Sciences > HB Economic Theory
Departments: Lancaster University Management School > Management Science
ID Code: 54571
Deposited By: ep_importer_pure
Deposited On: 28 May 2012 08:59
Refereed?: No
Published?: Published
Last Modified: 10 Apr 2014 02:52
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/54571

Actions (login required)

View Item