Discrete Analysis Operations Research (64 results)

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

hardcover. Condition: VERY GOOD. NONE. 537 clean, unmarked, tight pages; a couple pale smudges on top edge of textblock; cover is clean and sturdy; no dj as issued; May require extra shipping outside the U.S.

Hardcover. Condition: Very Good+. Dust Jacket Condition: No Dust Jacket Issued. First Edition. In English, with various translators. This book contains translations of papaers from the first volume of the new Russ-language journal published at the Sobolev Institute of Mathematics (Siberian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. The journal was titled 'Sibirskii Zhurnal Issledovaniya Operatsii', then 'Diskretnyi Analiz i Issledovanie Operatii'. Text appears clean, exterior looks great, binding tight/sturdy/square. NOT x-lib. Ships same or next business day from Dinkytown in Minneapolis, Minnesota.…

Hardcover. Condition: new. New Copy. Customer Service Guaranteed.

Hardcover. Condition: New. US SELLER SHIPS FAST FROM USA.

Hardcover. Condition: New. US SELLER SHIPS FAST FROM USA.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. The papers collected here provide an overview of recent Russian research in topics such as analysis of algorithms, combinatorics, graphs, lower bounds for complexity of Boolean functions, packing and coverings, scheduling theory, search and sorting, linear programming and testing. Editor(s): Korshunov, Alekseii D. Series: Mathematics and its Applications. Num Pages: 344 pages, biography. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 675. . 1995. Hardback. . . . . …

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: Good. Ehemaliges Bibliotheksexemplar. Mit Bibliotheksstempel und Aufkleber am Buchrücken. Als übereignet gekennzeichnet.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains translations of papers from the second volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was titled Sibirskil Zhurnal Issledovaniya Oper atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (Discrete Analysis and Operations Research). The aim of this journal is to bring together research papers in different areas of discrete mathematics and computer science. The journal DiskretnYl Analiz i Issledovanie Operatsil covers the following fields: discrete optimization synthesis and complexity discrete structures and of control systems extremal problems automata combinatorics graphs control and reliability game theory and its of discrete devices applications mathematical models and coding theory methods of decision making scheduling theory design and analysis functional systems theory of algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation. …

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence.- Locally Isometric Embeddings of Graphs and the Metric Prolongation Property.- Local Complementations of Simple and Directed Graphs.- An Approximation Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis.- On Minimum Independent Dominating Sets in Graphs.- Regular Partitions and Cuts in Integer Programming.- Complexity of Coverings of Number Sets by Arithmetical Progressions.- Circuit Realization of the Sorting Problem.- A Refinement of the Frank-Seb -Tardos Theorem and Its Applications.- On the Length of the Chinese Postman Tour in Regular Graphs.- An Integer Linear Programming Algorithm Polynomial in the Average Case.- Projections of the Hypercube on the Line and the Plane.- Canonical Decomposition of Graphs.- Fault Detection in Parts of the Circuits of Functional Elements.- On the External Stability Number of the Generalized De Bruijn Graphs.- On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions.- Efficient Scheduling in Open Shops.- Nonstrict Vector Summation in Scheduling Problems.- Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem.- On the Depth of Conditional Tests for Controlling 'Negation' Type Faults in Circuits of Functional Gates.- Synthesis of Transitive Order Relations Compatible with the Power of Criteria.…