12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > The max-cut and max-clique problems: linear ver...
View graph of relations

« Back

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

Research output: Contribution to conferenceConference paper

Published

Publication date03/2008
Number of pages2
Original languageEnglish

Conference

ConferenceInternational Symposium on Combinatorial Optimization (CO 2008)
CountryUnited Kingdom
CityWarwick
Period16/03/0819/03/08

Related projects