Integer programming: theory, applications, and computations

Integer Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming.Organized into eight chapters, this book b...

Descripción completa

Detalles Bibliográficos
Autores principales: Taha, Hamdy A, Schmidt, J William
Lenguaje:eng
Publicado: Academic Press 1975
Materias:
Mathematical Physics and Mathematics
Acceso en línea:http://cds.cern.ch/record/2031768
_version_ 1780947479852744704
author Taha, Hamdy A
Schmidt, J William
author_facet Taha, Hamdy A
Schmidt, J William
author_sort Taha, Hamdy A
collection CERN
description Integer Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming.Organized into eight chapters, this book begins with an overview of the general categorization of integer applications and explains the three fundamental techniques of integer programming. This text then explores the concept of implicit enumeration, which is general in a sense that it is applicable to any well-defined binary program. Other
id cern-2031768
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1975
publisher Academic Press
record_format invenio
spelling cern-20317682021-04-21T20:10:52Zhttp://cds.cern.ch/record/2031768engTaha, Hamdy ASchmidt, J WilliamInteger programming: theory, applications, and computationsMathematical Physics and MathematicsInteger Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming.Organized into eight chapters, this book begins with an overview of the general categorization of integer applications and explains the three fundamental techniques of integer programming. This text then explores the concept of implicit enumeration, which is general in a sense that it is applicable to any well-defined binary program. OtherAcademic Pressoai:cds.cern.ch:20317681975
spellingShingle Mathematical Physics and Mathematics
Taha, Hamdy A
Schmidt, J William
Integer programming: theory, applications, and computations
title Integer programming: theory, applications, and computations
title_full Integer programming: theory, applications, and computations
title_fullStr Integer programming: theory, applications, and computations
title_full_unstemmed Integer programming: theory, applications, and computations
title_short Integer programming: theory, applications, and computations
title_sort integer programming: theory, applications, and computations
topic Mathematical Physics and Mathematics
url http://cds.cern.ch/record/2031768
work_keys_str_mv AT tahahamdya integerprogrammingtheoryapplicationsandcomputations
AT schmidtjwilliam integerprogrammingtheoryapplicationsandcomputations

Ejemplares similares