English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160329
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Current approaches for solving over-constrained problems

AuthorsMeseguer, Pedro ; Bouhmala, Noureddine; Bouzoubaa, Taoufik; Irgens, Morten; Sanchez-Fibla, Marti
KeywordsMulti-objective optimization
Soft constraints
Over-constrained CSPs
Issue Date2003
CitationConstraints 8: 9- 39 (2003)
AbstractWe summarize existing approaches to model and solve overconstrained problems. These problems are usually formulated as combinatorial optimization problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization. Regarding solving methods, both systematic and local search approaches are considered. Finally we review a number of case studies on over-constrained problems taken from the specialized literature.
Identifiersdoi: 10.1023/A:1021902812784
issn: 1383-7133
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.