Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas
Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Boolean methods in operations research and related areas

Авторы: Hammer P.L., Rudeanu S.

Аннотация:

In classical analysis, there is a vast difference between the class of problems that may be handled by means of the methods of calculus and the class of problems requiring combinatorial techniques. With the advent of the digital computer, the distinction begins to blur, and with the increasing emphasis on problems involving optimization over structures, the distinction vanishes.
What is necessary for the analytic and computational treatment of significant questions arising in modern control theory, mathematical economics, scheduling theory, operations research, bioengineering, and so forth is a new and more flexible mathematical theory which subsumes both the classical continuous and discrete ilgorithms. The work by Hammer (Ivanescu) and Rudeanu on Boolean methods represents an important step in this direction, and it is thus a great pleasure to welcome it into print. It will certainly stimulate a great deal of additional research in both theory and application.


Язык: en

Рубрика: Наука/

Серия: Сделано в холле

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1968

Количество страниц: 329

Добавлена в каталог: 08.06.2011

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Partially determined Boolean function      291
Partially minimizing point of a pseudo-Boolean program      103
Particular solution of a Boolean equation      33
Path      173
Peripheral point      175
Point      172
Poretski, P.S.      26 47
Pospelov,D.A..      150 151
Postley, J.      40
Power of a Boolean matrix      12
Prime implicant      288
Principle of duality      6 17
Program segmentation      299
Proper grouping      296
Pseudo-Boolean equation      48 ff.
Pseudo-Boolean form of the characteristic function      97
Pseudo-Boolean function      21
Pseudo-Boolean program      102ff.
Pyne, I.B.      288
Quadratic (continuous) programming      164 ff.
Quasi-equivalent states      295
Quine, W.V.      212 290 293
Rad6, F.      92
Radius of a graph      175
Reduced graph      185
Reduct      83
Rosenberg, I.      II—IV 113 212 218 220 226 227 229 233 268 274 287 288 294ff. 301 307
Rosenblatt, D.      13
Rouche, N.      40
Roy, B.      49 172 174 183 185 186
Rudeanu, S.      1 6 20 30—32 36 39 47 48 82 102ff. 113 114 146 194 199 214 221 225 249 289 294 307
Rutherford, D.E.      6
Schroeder, E.      26 47
Schubert, E.L.      40
Sedmak,V.      47
Semon,W.      40
Separating set      242
Sequencing problem      268
Set of maximal deficiency      244
Shannon, C.E.      209
Sherman, G.R.      276
Simonnard, M.      163
Sink of a network      258
Skotem, Th.      47
Slagle, J.R.      286
Source of a network      258
Sowell, R.      IV.
Sprinkle, H.D.      47
Stahlknecht, P.      276
Stamm, E.      47
Stanojevic, C.      47
State assignment of sequential circuits      298—299
Strongly complete graph      174
Strongly connected component      180
Strongly connected graph      173 174
Sugino, K.      II 287 298
Sum modulo      2 20
Supply-demand problem      261
Sussman, JJ.      49
Svoboda, A.      40
Sweeney, D.W.      48
Symmetric difference      20
Symmetric supply-demand problem      262
Synthesis of multi-terminals      199
System of Boolean equations      25
System of distinct representatives      252
System of pseudo-Boolean equations and inequalities      65 90
System of representatives      252 ff.
System of restricted representatives      254
Tauts, A.      47
Time-table scheduling      274ff.
Tohma, Y.      40 47
Tomescu, I.      199
Toms, R.M.      40
Total graph      173
Transitive closure of a graph      174
Transitive graph      184
Transportation problem      1 246
Travelling-salesman problem      192
Tucker, A.W.      193
Two-element Boolean algebra ${B}_{2}$      3ff.
Udagawa, K.      298 299
Undirected graph      237
Unitary incidence matrix      176
Vasiliu, Em.      215
Vaughan, H.E.      257
Vaughan,R.      IV
Vertex      172
Vertex-elimination method      202
Vitaver, L.M.      233
von Neumann, J.      2
Wang, H.      47
Weissman, J.      211 212 229 233 234
Weisz, Gh.      IV 109
Whinston, A.      IV
Whitehead, A.N.      26 27 47
Whitesitt, J.E.      6
WitzgaU,C.      159
Zeleznikar, A.      40
Zemanek, H.      40
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте