Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>
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.
| Autorius: | Jean-Bernard Lasserre |
| Serija: | Springer Series in Operations Research and Financial Engineering |
| Leidėjas: | Springer US |
| Išleidimo metai: | 2010 |
| Knygos puslapių skaičius: | 184 |
| ISBN-10: | 1441918531 |
| ISBN-13: | 9781441918536 |
| Formatas: | 254 x 178 x 11 mm. Knyga minkštu viršeliu |
| Kalba: | Anglų |
Parašykite atsiliepimą apie „Linear and Integer Programming vs Linear Integration and Counting: A Duality Viewpoint“
