Geschäftskunden Kundenprogramme
Vor Ort
Merkzettel Warenkorb
Produktbild: Operations Research and Discrete Analysis
Band 391

Operations Research and Discrete Analysis

Aus der Reihe Mathematics and Its Applications

Fr. 143.00

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.10.2012

Herausgeber

Alekseii D. Korshunov

Verlag

Springer Netherland

Seitenzahl

336

Maße (L/B/H)

24/16/1.9 cm

Gewicht

557 g

Auflage

Softcover reprint of the original 1st ed. 1997

Sprache

Englisch

ISBN

978-94-010-6395-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.10.2012

Herausgeber

Alekseii D. Korshunov

Verlag

Springer Netherland

Seitenzahl

336

Maße (L/B/H)

24/16/1.9 cm

Gewicht

557 g

Auflage

Softcover reprint of the original 1st ed. 1997

Sprache

Englisch

ISBN

978-94-010-6395-1

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Operations Research and Discrete Analysis
  • Preface. On Discrete Approximations of Continuous Functions with Bounded Second Derivative; G.G. Amanzhaev. On a Property of Perfect Binary Codes; S.V. Avgustinovich. Edge Neighborhoods in Normal Maps; S.V. Avgustinovich, O.V. Borodin. An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube; P.G. Emel'yanov. Operations and Isometric Embeddings of Graphs Related to the Metric Prolongation Property; T.I. Fedoryaeva. Effective Algorithms for Solving Multi-Level Plant Location Problem; È.Kh. Gimadi. On the Complexity of Realization of Boolean Functions by Circuits over an Infinite Basis; O.M. Kasim-Zade. Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools; Yu.A. Kochetov, M.G. Pashchenko. Lower Bounds in the Problem of Choosing an Optimal Composition of a Two-Level System of Technical Tools; Yu.A. Kochetov, M.G. Pashchenko. On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time; A.V. Kononov. Problems of Reconstructing Words from Their Fragments and Applications; V.K. Leont'ev. A Vertex Variant of the Kleitman-West Problem; B. List. Regular Graphs Whose Every Edge Belongs to Many Triangles; A.A. Makhnëv. On Closed Classes in k-Valued Logic Which Contain a Homogeneous Switching Function; S.S. Marchenkov. Strongly Essential Variables of the Functions of k-Valued Logic; I. Mirchev. On Comparison Between the Sizes of Read-k-Times Branching Programs; E.A. Okol'nishnikova. Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network; A.V. Pyatkin. The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces; A.I. Serdyukov. Nonstrict Vector Summation in the Plane and Its Applications to Scheduling Problems; S.V. Sevast'yanov.Bounds for Approximate Solution of a Scheduling Problem; P.I. Sharygin. On Certain Bounds for the Weight of l- Balanced Boolean Functions; Yu.V. Tarannikov. Spectral Properties of Perfect Binary (n,3)-Codes; A.Yu. Vasile'va. Distributive Coloring of Graph Vertices; V.G. Vizing. Deciphering Threshold Functions of k-Valued Logic; N.Y. Zolotykh, V.N. Shevchenko. Index.