Français
France
s'inscrire
Conseils d'eurolivre.fr
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
Livre conseillé
Actualités
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 111,81 €, prix le plus élevé: 117,69 €, prix moyen: 116,51 €
Linear and Integer Programming vs Linear Integration and Counting - Jean B. Lasserre
Livre non disponible
(*)
Jean B. Lasserre:
Linear and Integer Programming vs Linear Integration and Counting - nouveau livre

2009, ISBN: 038709413X

ID: 9730366980

[EAN: 9780387094137], Neubuch, [SC: 29.18], [PU: Springer Apr 2009], LINEARE PROGRAMMIERUNG; OPTIMIERUNG, Mathematics|Linear Programming, Business & Economics|Operations Research, Neuware - Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x 1928x 11111x 2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x N, 1 2 3 4 5 taken from a list of dif cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint. 184 pp. Englisch

Nouveaux livres ZVAB.com
AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoi EUR 29.18
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Linear and Integer Programming vs Linear Integration and Counting - Jean B. Lasserre
Livre non disponible
(*)
Jean B. Lasserre:
Linear and Integer Programming vs Linear Integration and Counting - nouveau livre

2009, ISBN: 038709413X

ID: 9730366980

[EAN: 9780387094137], Neubuch, [PU: Springer Apr 2009], LINEARE PROGRAMMIERUNG; OPTIMIERUNG, Mathematics|Linear Programming, Business & Economics|Operations Research, Neuware - Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x 1928x 11111x 2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x N, 1 2 3 4 5 taken from a list of dif cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint. 184 pp. Englisch

Nouveaux livres Abebooks.de
AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoi EUR 29.39
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Linear and Integer Programming vs Linear Integration and Counting - Jean B. Lasserre
Livre non disponible
(*)
Jean B. Lasserre:
Linear and Integer Programming vs Linear Integration and Counting - nouveau livre

2009, ISBN: 038709413X

ID: 19150385433

[EAN: 9780387094137], Neubuch, [PU: Springer Apr 2009], LINEARE PROGRAMMIERUNG; OPTIMIERUNG, Mathematics|Linear Programming, Business & Economics|Operations Research, Neuware - Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x 1928x 11111x 2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x N, 1 2 3 4 5 taken from a list of dif cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint. 184 pp. Englisch

Nouveaux livres Abebooks.de
Rhein-Team Lörrach Ivano Narducci e.K., Lörrach, Germany [57451429] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoi EUR 11.96
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Linear and Integer Programming vs Linear Integration and Counting - Jean B. Lasserre
Livre non disponible
(*)
Jean B. Lasserre:
Linear and Integer Programming vs Linear Integration and Counting - nouveau livre

2009, ISBN: 038709413X

ID: 19149857668

[EAN: 9780387094137], Neubuch, [PU: Springer Apr 2009], LINEARE PROGRAMMIERUNG; OPTIMIERUNG, Mathematics|Linear Programming, Business & Economics|Operations Research, Neuware - Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min{213x 1928x 11111x 2345x +9123x} 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x N, 1 2 3 4 5 taken from a list of dif cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint. 184 pp. Englisch

Nouveaux livres Abebooks.de
Agrios-Buch, Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoi EUR 19.92
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Linear and Integer Programming vs Linear Integration and Counting - Jean B. Lasserre
Livre non disponible
(*)
Jean B. Lasserre:
Linear and Integer Programming vs Linear Integration and Counting - nouveau livre

ISBN: 9780387094137

[ED: Buch], [PU: Springer], Neuware - Integer programming (IP) is a fascinating topic. Indeed, while linear programming (LP), its c- tinuous analogue, is well understood and extremely ef cient LP software packages exist, solving an integer program can remain a formidable challenge, even for some small size problems. For instance, the following small (5-variable) IP problem (called the unbounded knapsack problem) min213x 1928x 11111x 2345x +9123x 1 2 3 4 5 s.t. 12223x +12224x +36674x +61119x +85569x = 89643482, 1 2 3 4 5 x ,x ,x ,x ,x N, 1 2 3 4 5 taken from a list of dif cult knapsack problems in Aardal and Lenstra [2], is not solved even by hours of computing, using for instance the last version of the ef cient software package CPLEX. However,thisisnotabookonintegerprogramming,asverygoodonesonthistopicalreadyexist. For standard references on the theory and practice of integer programming, the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and the more recent Bertsimas and Weismantel [21]. On the other hand, this book could provide a complement to the above books as it develops a rather unusual viewpoint., [SC: 0.00], Neuware, gewerbliches Angebot, 235x178x16 mm, [GW: 510g]

Nouveaux livres Booklooker.de
Buchhandlung Hoffmann
Frais d'envoiVersandkostenfrei (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

Détails sur le livre
Linear and Integer Programming vs Linear Integration and Counting

This book analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, and linear summation (or counting). The focus is on duality and the novel approach puts integer programming in perspective with three associated problems, and permits one to define discrete analogues of well-known continuous duality concepts, and the rationale behind them. Also, the approach highlights the difference between the discrete and continuous cases. Central in the analysis are the continuous and discrete Brion and Vergne's formulae for linear integration and counting which are not very well-known in the optimization community. This approach provides some new insights on duality concepts for integer programs, and also permits to retrieve and shed new light on some well-known results. For instance, Gomory relaxations and the abstract superadditive dual of integer programs are re-interpreted in this algebraic approach. This book will serve graduate students and researchers in applied mathematics, optimization, operations research and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will also find this book useful.

Informations détaillées sur le livre - Linear and Integer Programming vs Linear Integration and Counting


EAN (ISBN-13): 9780387094137
ISBN (ISBN-10): 038709413X
Version reliée
Date de parution: 2009
Editeur: Springer-Verlag GmbH
168 Pages
Poids: 0,474 kg
Langue: eng/Englisch

Livre dans la base de données depuis 21.04.2008 21:50:26
Livre trouvé récemment le 18.04.2017 10:29:11
ISBN/EAN: 038709413X

ISBN - Autres types d'écriture:
0-387-09413-X, 978-0-387-09413-7


< pour archiver...
Livres en relation