1995 RUTCOR Research Reports

• ABSTRACTS

• 1-95 Horn Functions and Submodular Boolean Functions, Oya Ekin, Peter L. Hammer and Uri N. Peled.
• 2-95 Optimal cell flipping to minimize channel density in VLSI design and a class of PseudoBoolean optimization problems, Endre Boros, Peter L. Hammer and Michel Minoux
• 3-95 Gridline Graphs and Higher Dimensional Extensions , Dale Peterson
• 4-95 On the Power of Democratic Networks , Eddy Mayoraz
• 5-95 Algorithmic Modeling of TES Processes , Predrag R. Jelenkovic and Benjamin Melamed
• 6-95 Relation between Protein Structure, Sequence Homology and Composition of Amino Acids , Eddy Mayoraz, Inna Dubchak and Ilya Muchnik
• 7-95 A Nonfeasible-Interior-Point Method for Linear Complementarity Problems , Evangelia M. Simantiraki and David F. Shanno
• 8-95 The Elimination Algorithm for the Competition Number, Suh-Ryung Kim and Fred S. Roberts (Available in printed form only)
• 9-95 Competition number of Graphs with a Small Number of Triangles , Suh-Ryung Kim and Fred S. Roberts (Available in printed form only)
• 10-95 Polynomial Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle , Endre Boros, Peter L. Hammer, Toshihide Ibaraki and Kazuhiko Kawakami
• 11-95 Reductions for the Rectilinear Steiner Tree Problem , Pawel Winter
• 12-95 A Better Heuristic for Orthogonal Graph Drawings , Therese Biedl and Goos Kant
• 13-95 Computationally Manageable Combinatorial Auctions , Michael H. Rothkopf, Aleksandar Pekec and Ronald M. Harstad
• 14-95 Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions , Endre Boros, Toshihide Ibaraki and Kazuhisa Makino
• 15-95 On the Effective and Rational Distribution of Incomes, Gabor Goldner and Bela Vizvari
• 16-95 A Survey of TES Modeling Applications, Benjamin Melamed and Jon R. Hill
• 17-95 The QTES/PH/1 Queue, Benjamin Melamed, Qiang Ren and Bhaskar Sengupta
• 18-95 Operations On Graphs Increasing Their Laplacian Polynomials, Alexander K. Kelmans
• 19-95 New Lower Bounds for Orthogonal Graph Drawings, Therese C. Biedl
• 20-95 Perfect $0,\pm 1$ Matrices, Endre Boros and Ondrej Cepek
• 21-95 Powers of Circulants in Bottleneck Algebra, A.O.L. Atkin, Endre Boros, Katarina Cechlarova, Uri N. Peled
• 22-95 Stable Families of Coalitions and Normal Hypergraphs, E. Boros, V. Gurvich and A. Vasin
• 23-95 Stable Effectivity Functions and Perfect Graphs, E. Boros and V. Gurvich
• 24-95 Bounding in Multi-Stage Stochastic Programming Problems, Olga Fiedler and Andras Prekopa
• 25-95 On a Dual Method for a Specially Structured Linear Programming Problem, Olga Fiedler, Andras Prekopa and Csaba I. Fabian
• 26-95 Variable and Term Removal From Boolean Formulae, Yves Crama, Oya Ekin and Peter L. Hammer
• 27-95 Horn Extensions of a Partially Defined Boolean Function, Kazuhisa Makino, Ken-ichi Hatanaka and Toshihide Ibaraki
• 28-95 Single Machine Scheduling with Earliness and Tardiness Penalties: When is an Optimal Solution Not Optimal?, N.V.R. Mahadev, Aleksandar Pekec and Fred S. Roberts
• 29-95 Positive and Horn Decomposability of Partially Defined Boolean Functions, Kazuhisa Makino, Koji Yano and Toshihide Ibaraki
• 30-95 Choosability of Perfect Line Graphs, Dale Peterson
• 31-95 Newton method with modified functions, Adi Ben-Israel
• 32-95 Singular Values and Maximum Rank Minors of Generalized Inverses, R.B. Bapat and Adi Ben-Israel
• 33-95 Product Cosines of Angles between Subspaces, Jianming Miao and Adi Ben-Israel
• 34-95 Constructive Training Methods for Feedforward Neural Networks with Binary Weights, Eddy Mayoraz and Frederic Aviolat
• 35-95 On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions, Vladimir Gurvich and Leonid Khachiyan
• 36-95 Lower and Upper Bounds on Probabilities of Boolean Functions of Events , Bela Vizvari and Andras Prekopa
• 37-95 An Infeasible-Interior-Point Algorithm for Solving Mixed Complementarity Problems, Evangelia M. Simantiraki and David F. Shanno
• 38-95 Role Assignments and Indifference Graphs, Fred S. Roberts (Available in printed form only)
• 39-95 Implementing Barrier Methods for Nonlinear Programming, David F. Shanno, Marc G. Breitfeld, and Evangelia M. Simantiraki
• 40-95 On the Complexity of Semidefinite Programs, Lorant Porkolab and Leonid Khachiyan
• 41-95 Computing Equilibria of Oligopolistic Pricing Models, Evangelia M. Simantiraki and David F. Shanno
• 42-95 On an Aircraft Scheduling Problem with Priorities and Earliness/Tardiness Penalties, N.V.R. Mahadev, Aleksandar Pekec, and Fred S. Roberts
• 43-95 Analytically Beyond Black-Scholes?, Galin Georgiev
• 44-95 Bounds on the Degree of High Order Binary Perceptrons, Eddy Mayoraz
• 45-95 Inner-Core and Outer-Core Functions of Partially Defined Boolean Functions, Kazuhisa Makino and Toshihide Ibaraki
• 46-95 Primal-Dual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems, I. Adler and F. Alizadeh
• 47-95 Complementarity and Nondegeneracy in Semidefinite Programming Farid Alizadeh, Jean-Pierre A. Haeberly and Michael L. Overton
• 48-95 Physical Mapping of Chromosomes Using Unique Probes Farid Alizadeh, Richard M. Karp, Deborah K. Weisser and Geoffrey Zweig
• 49-95 Optimal Adaptive Policies for Sequential Allocation Problems, Apostolos N. Burnetas and Michael N. Katehakis (Available in printed form only)
• 50-95 Sequential Choice from Several Populations, Michael N. Katehakis and Herbert Robbins (Available in printed form only)
• 51-95 Optimal Adaptive Policies for Markov Decision Processes, Apostolos N. Burnetas and Michael N. Katehakis (Available in printed form only)

Last Modified: January 30, 1996