Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

A polyhedral study of the cardinality constrained knapsack problem

Author
DE FARIAS, I. R1 ; NEMHAUSER, G. L2
[1] CORE, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium
[2] School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, United States
Source

Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, 29 p ; ref : 49 ref

CODEN
MHPGA4
ISSN
0025-5610
Scientific domain
Control theory, operational research; Mathematics
Publisher
Springer, Heidelberg
Publication country
Germany
Document type
Article
Language
English
Author keyword
branch-and-cut cardinality constrained programming knapsack problem mixed-integer programming
Keyword (en)
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems

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

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