search query: @indexterm BRANCH AND BOUND METHODS / total: 70
reference: 15 / 70
| Author: | Bisdorff, R. Laurent, S. |
| Title: | Industrial linear optimization problems solved by constraint logit programming |
| Journal: | European Journal of Operational Research
1995 : JUL 7, VOL. 84:1, p. 82-95 |
| Index terms: | OPERATIONAL RESEARCH BRANCH AND BOUND METHODS GOAL PROGRAMMING |
| Language: | eng |
| Abstract: | In this article the authors try to illustrate that constraint logic programming (CLP) systems allow easy expression and solution of constrained decision problems. In order to do so, This paper proposes CLP solutions for two industrial linear optimization problems respectively using the Prolog III and CHIP language. The first problem illustrates the general linear rational solver. The second problem is only concerned with integer finite domain variables and is particularly adapted to the CHIP system that provides a computation domain handling such variables. |
SCIMA