Εξώφυλλο

Constraint programming and maths programming

Αποθηκεύτηκε σε:
Εκδόθηκε σε:The Knowledge Engineering Review vol. 16, no. 1 (Mar 2001), p. 5-23
Κύριος συγγραφέας: PUGET, JEAN-FRANÇOIS
Άλλοι συγγραφείς: LUSTIG, IRVIN
Έκδοση:
Cambridge University Press
Θέματα:
Production planning
Mathematical programming
Variables
Linear programming
Computer science
Algorithms
Simplex method
Διαθέσιμο Online:Citation/Abstract
Full Text - PDF
Ετικέτες: Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!

MARC

LEADER 00000nab a2200000uu 4500
001 217516647
003 UK-CbPIL
022 |a 0269-8889 
022 |a 1469-8005 
035 |a 217516647 
045 2 |b d20010301  |b d20010331 
084 |a 79065  |2 nlm 
100 1 |a PUGET, JEAN-FRANÇOIS 
245 1 |a Constraint programming and maths programming 
260 |b Cambridge University Press  |c Mar 2001 
513 |a Feature 
520 3 |a Maths programming (MP) and constraint programming (CP) are two techniques that are able to solve difficult industrial optimisation problems. The purpose of this paper is to compare them from an algorithmic and a modelling point of view. Algorithmic principles of each approach are described and contrasted. Some ways of combining both techniques are also introduced. [PUBLICATION ABSTRACT] 
653 |a Production planning 
653 |a Mathematical programming 
653 |a Variables 
653 |a Linear programming 
653 |a Computer science 
653 |a Algorithms 
653 |a Simplex method 
700 1 |a LUSTIG, IRVIN 
773 0 |t The Knowledge Engineering Review  |g vol. 16, no. 1 (Mar 2001), p. 5-23 
786 0 |d ProQuest  |t ABI/INFORM Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/217516647/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/217516647/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch