Szczegóły publikacji
Opis bibliograficzny
Constraint optimization production planning problem : a note on theory, selected approaches and computational experiments / Weronika T. ADRIAN, Nicola Leone, Antoni LIGĘZA, Marco Manna, Mateusz ŚLAŻYŃSKI // W: Artificial Intelligence and Soft Computing : 14th International Conference, ICAISC 2015 : Zakopane, Poland, June 14–18, 2015 : proceedings, Pt. 2 / eds. Leszek Rutkowski, [et al.]. — Cham, [etc.] : Springer, cop. 2015. — (Lecture Notes in Computer Science ; ISSN 0302-9743. Lecture Notes in Artificial Intelligence ; LNAI 9120). — ISBN: 978-3-319-19368-7; e-ISBN: 978-3-319-19369-4. — S. 541–553. — Bibliogr. s. 552–553, Abstr. — Weronika T. Adrian - dod. afiliacja: University of Calabria, Italy
Autorzy (5)
- AGHAdrian Weronika Teresa
- Leone P.
- AGHLigęza Antoni
- Manna Marco
- AGHŚlażyński Mateusz
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 90228 |
|---|---|
| Data dodania do BaDAP | 2015-07-03 |
| DOI | 10.1007/978-3-319-19369-4_48 |
| Rok publikacji | 2015 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Conference on Artificial Intelligence and Soft Computing 2015 |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
This paper presents an interesting discrete optimization problem which was stated as a challenge at the 2014 Bologna Summer School of Constraint Programming. The problem is given in two versions: a tractable one of a small size, for training, and a large one for the competition. A formalization of the problem is proposed, and its theoretical properties are analyzed. Several approaches for solving the problem are presented in detail. Namely, formalizations in Answer Set Programming, Prolog, and Julia are presented, and the obtained results are discussed and compared. The experiments show that different tools allow to handle different aspects of constraint programming.
