---

＜電子ブック＞
Operations Research and Discrete Analysis / edited by Alekseii D. Korshunov
(Mathematics and Its Applications ; 391)

版	1st ed. 1997.
出版者	(Dordrecht : Springer Netherlands : Imprint: Springer)
出版年	1997
本文言語	英語
大きさ	VII, 336 p : online resource
著者標目	Korshunov, Alekseii D editor SpringerLink (Online service)
件　名	LCSH:Discrete mathematics LCSH:Computer science -- Mathematics  全ての件名で検索 LCSH:Computer science LCSH:Mathematical optimization FREE:Discrete Mathematics FREE:Discrete Mathematics in Computer Science FREE:Theory of Computation FREE:Optimization
一般注記	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 HTTP:URL=https://doi.org/10.1007/978-94-011-5678-3

 類似資料