Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18999645

A polynomial algorithm for one problem of guillotine cutting

Author
ARSLANOV, M. Z1
[1] Institute of Problems of Informatics and Control, Süleiman Demirel University, Pushkin str.125, Almaty 050010, Kazakhstan
Source

Operations research letters. 2007, Vol 35, Num 5, pp 636-644, 9 p ; ref : 12 ref

CODEN
ORLED5
ISSN
0167-6377
Scientific domain
Control theory, operational research
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Convex hull Cutting Polynomial algorithms
Keyword (fr)
Enveloppe convexe Méthode polynomiale Rotation Temps polynomial
Keyword (en)
Convex hull Polynomial method Rotation Polynomial time
Keyword (es)
Cápsula convexa Método polinomial Rotación Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science

Discipline
Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
18999645

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web