Journal article icon

Journal article

Soft constraints: Complexity and multimorphisms

Abstract:

Over the past few years there has been considerable progress in methods to systematically analyse the complexity of classical (crisp) constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of classical constraints to a corresponding set of algebraic operations, known as polymorphisms. In this paper we begin a systematic investigation of the complexity of combinatorial optimisation problems expresse...

Expand abstract
Publication status:
Published

Actions


Journal:
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS More from this journal
Volume:
2833
Pages:
244-258
Publication date:
2003-01-01
EISSN:
1611-3349
ISSN:
0302-9743
Language:
English
Pubs id:
pubs:328588
UUID:
uuid:0a79e060-a5a1-4638-9ec0-a28916abddd6
Local pid:
pubs:328588
Source identifiers:
328588
Deposit date:
2013-11-17

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP