Cantitate/Preț
Produs

Operations Research and Discrete Analysis: Mathematics and Its Applications, cartea 391

Editat de Alekseii D. Korshunov
en Limba Engleză Hardback – 31 dec 1996

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 62983 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 11 oct 2012 62983 lei  6-8 săpt.
Hardback (1) 63609 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 31 dec 1996 63609 lei  6-8 săpt.

Din seria Mathematics and Its Applications

Preț: 63609 lei

Preț vechi: 74834 lei
-15% Nou

Puncte Express: 954

Preț estimativ în valută:
12193 12797$ 10056£

Carte tipărită la comandă

Livrare economică 24 ianuarie-07 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792343349
ISBN-10: 0792343344
Pagini: 336
Ilustrații: VII, 336 p.
Dimensiuni: 170 x 244 x 21 mm
Greutate: 0.66 kg
Ediția:1997
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

On Discrete Approximations of Continuous Functions with Bounded Second Derivative.- On a Property of Perfect Binary Codes.- Edge Neighborhoods in Normal Maps.- An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube.- Operations and Isometric Embeddings of Graphs Related to the Metric Prolongation Property.- Effective Algorithms for Solving Multi-Level Plant Location Problem.- On the Complexity of Realization of Boolean Functions by Circuits over an Infinite Basis.- Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools.- Lower Bounds in the Problem of Choosing an Optimal Composition of a Two-Level System of Technical Tools.- On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time.- Problems of Reconstructing Words from Their Fragments and Applications.- A Vertex Variant of the Kleitman-West Problem.- Regular Graphs Whose Every Edge Belongs to Many Triangles.- On Closed Classes in k-Valued Logic Which Contain a Homogeneous Switching function.- Strongly Essential Variables of the Functions of k- Valued Logic.- On Comparison Between the Sizes of Read-k-Times Branching Programs.- Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network.- The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces.- Nonstrict Vector Summation in the Plane and Its Applications to Scheduling Problems.- Bounds for Approximate Solution of a Scheduling Problem.- On Certain Bounds for the Weight of l-Balanced Boolean Functions.- Spectral Properties of Perfect Binary (n,Z)-Codes.- Distributive Coloring of Graph Vertices.- Deciphering Threshold Functions of k- Valued Logic.