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: International Symposium on Combinatorial Optimization (CO 2008), 2008-03-162008-03-19, Warwick.

Full text not available from this repository.
Item Type: Conference or Workshop Item (Paper)
Journal or Publication Title: International Symposium on Combinatorial Optimization (CO 2008)
Uncontrolled Keywords: combinatorial optimisation ; graph theory ; semidefinite programming
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?: Yes
Published?: Published
Last Modified: 09 Apr 2015 09:52
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/54571

Actions (login required)

View Item