Cantitate/Preț
Produs

Integer Programming: Mathematics and its Applications, cartea 46

Autor Stanislav Walukiewicz
en Limba Engleză Hardback – 31 mai 1991
'Et moi, ... , so j'avait su comment en revenir, One service mathematics has rendered the je n'y serais point al!e.' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non­ The series is divergent; therefore we may be sense'. able to do something with it. Eric T. Bell 0. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlinearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics ... '; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics ... '. All armably true. And all statements obtainable this way form part of the raison d'etre of this series.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 17804 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 9 dec 2010 17804 lei  6-8 săpt.
Hardback (1) 20116 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 31 mai 1991 20116 lei  6-8 săpt.

Din seria Mathematics and its Applications

Preț: 20116 lei

Preț vechi: 25145 lei
-20% Nou

Puncte Express: 302

Preț estimativ în valută:
3852 4011$ 3196£

Carte tipărită la comandă

Livrare economică 13-27 februarie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792307266
ISBN-10: 0792307267
Pagini: 182
Ilustrații: XVI, 182 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.46 kg
Ediția:1990
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and its Applications

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

1. Introduction.- 2. Linear Programming.- 3. Unimodularity and Network Flows. Cutting-Plane Methods.- 4. Branch-and-Bound Methods.- 5. The Knapsack Problem.- 6. Equivalent Formulations for Integer Programs.- 7. Relaxations of Integer Problems. Duality.- 8. Some Particular Integer Programming Problems.- 9. Near-Optimal Methods.- 10. Conclusions.