๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some branch and bound techniques for nonlinear optimization

โœ Scribed by D. Kennedy


Book ID
105251118
Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
578 KB
Volume
42
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Enhancing CLP branch and bound technique
โœ F. Bosi; M. Milano ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 280 KB

In this paper, we propose a constraint logic programming (CLP) approach to the solution of a job shop scheduling problem in the field of production planning in orthopaedic hospital departments. A pure CLP on finite domain (CLP(FD)) approach to the problem has been developed, leading to disappointing