Article (Scientific journals)
Industrial linear optimization problems solved by constraint logic programming
Bisdorff, Raymond; Laurent, S.
1995In European Journal of Operational Research, 84 (1), p. 82-95
Peer reviewed
 

Files


Full Text
credi-R-93-004.pdf
Author preprint (7.77 MB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Constraint logic programming; Finite domain computation; linear optimization; industrial disposing problem; industrial production scheduling
Abstract :
[en] In this article we illustrate that Constraint Logic Programming (CLP) systems allow easy expression and solutions of constrained decision problems. CLP solutions for two industrial linear optimization problems are discussed: - a mixed linear multiple criteria selection problem implemented in the linear rational Prolog III solver, and - a linear integer multiple criteria location problem, particularly adapted to the CHIP solver.
Research center :
Centre de Recherche Publique - Centre Universitaire
Disciplines :
Computer science
Author, co-author :
Bisdorff, Raymond ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Laurent, S.
External co-authors :
no
Language :
English
Title :
Industrial linear optimization problems solved by constraint logic programming
Publication date :
1995
Journal title :
European Journal of Operational Research
ISSN :
0377-2217
Publisher :
Elsevier B.V.
Volume :
84
Issue :
1
Pages :
82-95
Peer reviewed :
Peer reviewed
Focus Area :
Computational Sciences
Commentary :
cited By 0 Scopus
Available on ORBilu :
since 19 January 2016

Statistics


Number of views
51 (1 by Unilu)
Number of downloads
118 (1 by Unilu)

Scopus citations®
 
6
Scopus citations®
without self-citations
6
OpenCitations
 
4
WoS citations
 
5

Bibliography


Similar publications



Contact ORBilu