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, University of Warwick.

Full text not available from this repository.
Item Type:
Contribution to Conference (Paper)
Journal or Publication Title:
International Symposium on Combinatorial Optimization (CO 2008)
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
54571
Deposited By:
Deposited On:
28 May 2012 07:59
Refereed?:
Yes
Published?:
Published
Last Modified:
24 May 2020 08:36