Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

On identifying maximal covers

Author
MUNOZ, S1
[1] Departamento de Estadística e Investigación Operativa I, Facultad de Ciencias Matemáticas, Universidad Complutense de Madrid, Ciudad Universitaria, 28040 Madrid, Spain
Source

SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 4, pp 749-768, 20 p ; ref : 32 ref

CODEN
SJDMEC
ISSN
0895-4801
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Author keyword
90C05 dominated inequalities 90C10 knapsack constraints maximal covers tighter formulations
Keyword (fr)
Mathématiques discrètes Problème localisation Problème sac à dos Relation ordre Théorie contrainte Cardinalité Inégalité dominée Recouvrement maximal
Keyword (en)
Discrete mathematics Location problem Knapsack problem Ordering Constraint theory Dominated inequality Maximal cover
Keyword (es)
Matemáticas discretas Problema localización Problema mochila Relación orden
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming

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

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