liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Introduction to the Maximum Solution Problem
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
2008 (English)In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) / [ed] Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer, Berlin: Springer , 2008, 255-282 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper surveys complexity and approximability results for the Maximum Solution (Max Sol) problem. Max Sol is an optimisation variant of the constraint satisfaction problem. Many important and well-known combinatorial optimisation problems are instances of Max Sol: for example, Max Sol restricted to the domain {0,1} is exactly the Max Ones problem (which, in turn, captures problems such as Independent Set and 0/1 Integer Programming). By using this relationship, many different problems in logic, graph theory, integer programming, and algebra can be given a uniform treatment. This opens up for new ways of analysing and solving combinatorial optimisation problems.

Place, publisher, year, edition, pages
Berlin: Springer , 2008. 255-282 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 5250
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-44284DOI: 10.1007/978-3-540-92800-3_10Local ID: 76174ISBN: 978-3-540-92799-0 (print)ISBN: 978-3-540-92800-3 (print)OAI: oai:DiVA.org:liu-44284DiVA: diva2:265146
Conference
Complexity of Constraints: An Overview of Current Research Themes. LNCS 5250.,2006
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2017-02-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Jonsson, PeterNordh, Gustav

Search in DiVA

By author/editor
Jonsson, PeterNordh, Gustav
By organisation
The Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf