Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

The knapsack sharing problem: An exact algorithm

Author
HIFI, Mhand1 2 ; SADFI, Slim1 3
[1] CERMSEM, Maison des Sciences Economiques, Université de Paris 1 Panthéon-Sorbonne, 106-112 Boulevard de l'Hôpital, 75647 Paris, France
[2] PRiSM, Université de Versailles St-Quentin-en-Yvelines, 45 av. des Etats-Unis, 78035 Versailles, France
[3] LRI, URA 410 CNRS, Université de Paris XI, Centre d'Orsay, 91405 Orsay, France
Source

Journal of combinatorial optimization. 2002, Vol 6, Num 1, pp 35-54 ; ref : 24 ref

ISSN
1382-6905
Scientific domain
Control theory, operational research; Mathematics
Publisher
Springer, Norwell, MA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Optimisation combinatoire Performance algorithme Problème sac à dos Programmation dynamique Algoritme séquentiel
Keyword (en)
Combinatorial optimization Algorithm performance Knapsack problem Dynamic programming
Keyword (es)
Optimización combinatoria Resultado algoritmo Problema mochila Programación dinámica
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
13427475

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

Searching the Web