2000 RUTCOR Research Reports

• ABSTRACTS

• 1-2000 Normal Forms of Pseudo-Boolean Functions , Stephan Foldes and Peter L. Hammer
• 2-2000 Monotone, Horn and Quadratic Pseudo-Boolean Functions , Stephan Foldes and Peter L. Hammer
• 3-2000 Discrete Higher Order Convex Functions and Their Applications , Andras Prekopa
• 4-2000 Dynamics Aggregation in Stochastic Control Problems , Andrzej Ruszczynski
• 5-2000 Using Net Condition/Event Systems to Obtain Admissible Behavior , Luz Pinzon, Mohsen Jafari and Hans-Michael Hanisch
• 6-2000 Edge-Local Structure of Line Graphs of Linear $k$-Uniform Hypergraphs. Part. 3. Uniqueness and reduction , Igor E. Zverovich
• 7-2000 Item Parameter Calibration of LSAT Items Using MCMC Approximation of Bayes Posterior Distributions , Douglas H. Jones and Mikhail Nediak
• 8-2000 Characterization and Recognition of Strongly 3-Colorable Graphs , Igor E. Zverovich
• 9-2000 Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming , Darinka Dentcheva, Andras Prekopa and Andrzej Ruszczynski
• 10-2000 Uniqueness of a Strong 3-Coloring , Igor E. Zverovich
• 11-2000 Robust algorithms for the stable set problem , Michael U. Gerber and Vadim V. Lozin
• 12-2000 Disjunctive and Conjunctive Representations in Finite Lattices and Convexity Spaces , Stephan Foldes and Peter L. Hammer
• 13-2000 Finding Small Sets of Essential Attributes in Binary Data , Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino and Mutsunori Yagiura
• 14-2000 Upper Bounds on the Probability of the Union of Events , Pierangela Veneziani
• 15-2000 Lower Bounds on the Probability of the Union of Events , Pierangela Veneziani
• 16-2000 Perfect Cochromatic Graphs , Igor E. Zverovich
• 17-2000 Characterizations of Closed Classes of Boolean Functions in Terms of Forbidden Subfunctions and Post Classes , Igor E. Zverovich
• 18-2000 Block Linear Majorants in Quadratic 0-1 Optimization , Endre Boros, Isabella Lari and Bruno Simeone
• 19-2000 Saturated Systems of Homogeneous Boxes and the Logical Analysis of Numerical Data , Peter L. Hammer, Ying Liu, Bruno Simeone and Sandor Szedmak
• 20-2000 On a generalization of bi-complement reducible graphs , Vadim V. Lozin
• 21-2000 Probabilistic Programs with Discrete Distributions and Precedence Constrained Knapsack Polyhedra , Andrzej Ruszczynski
• 22-2000 Classes of Boolean Functions Defined by Diamond-Formulae , Grant R. Pogosyan
• 23-2000 Consensus algorithms for the generation of all maximal bicliques , Gabriela Alexe, Sorin Alexe, Stephan Foldes, Peter L. Hammer and Bruno Simeone
• 24-2000 On the stable set problem in special P5-free graphs , Michael U. Gerber and Vadim V. Lozin
• 25-2000 On orthogonal representations of graphs , Vladimir E. Alekseev and Vadim V. Lozin
• 26-2000 A Newton Method for Systems of m Equations in n Variables , Yuri Levin and Adi Ben-Israel
• 27-2000 A Direct Approach to Calculus of Variations via Newton-Raphson Method , Yuri Levin, Mikhail Nediak and Adi Ben-Israel
• 28-2000 Directional Halley and Quasi-Halley Methods in n Variables , Yuri Levin and Adi Ben-Israel
• 29-2000 Analysis of Two-Valve Continuous Flow Systems with Two Types of Materials , Unsal Ozdogru and Tayfur Altiok
• 30-2000 Convexity of the Set of P-level Efficient Points , Peter Benczur
• 31-2000 Bundle-Type Methods for Two-Stage Stochastic Programming Problems , Csaba I. Fabian
• 32-2000 Post Classes Characterized by Functional Terms , Stephan Foldes and Grant R. Pogosyan
• 33-2000 The Newton Bracketing Method for Convex Minimization , Yuri Levin and Adi Ben-Israel
• 34-2000 On Functional Dependencies in q-Horn Theories , Toshihide Ibaraki, Alexander Kogan and Kazuhisa Makino
• 35-2000 Inferring Minimal Functional Dependencies in Horn and q-Horn Theories , Toshihide Ibaraki, Alexander Kogan and Kazuhisa Makino
• 36-2000 A Two-Valve Flow System with Random Material Arrival Process , Unsal Ozdogru and Tayfur Altiok
• 37-2000 Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach , Avigdor Gal and Jonathan Eckstein
• 38-2000 Asymptotically Optimal Tree--Pacings in Regular Graphs , Alexander K. Kelmans, Dhruv Mubayi and Benny Sudakov
• 39-2000 Discrete Higher Order Convex Functions and Their Applications , Andras Prekopa
• 40-2000 PICO: An Object-Oriented Framework for Parallel Branch and Bound , Jonathan Eckstein, Cynthia A. Phillips and William E. Hart
• 41-2000 On Multivariate Discrete Moment Problems and their Applications to Bounding Expectations and Probabilities , Gergely Nagy and Andras Prekopa
• 42-2000 A heuristic for Boolean optimization problems , Thomas Davoine, Peter L. Hammer and Bela Vizvari
• 43-2000 Rescaling and Stepsize Selection in Proximal Methods using Separable Generalized Distances , (revision of RRR 35-99) Paulo Jose da Silva e Silva, Jonathan Eckstein and Carlos Humes Jr.
• 44-2000 Probability Bounds with Cherry trees , (revision of RRR 04-99) Jozsef Bukszar and Andras Prekopa
• 45-2000 The integer programming background of a stochastic integer programming algorithm of Dentcheva et al. , Bela Vizvari
• 46-2000 Generating Weighted Transversals of a Hypergraph , Endre Boros, Vladimir Gurvich, Leonid Khachiyan and Kazuhisa Makino
• 47-2000 An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension , E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan
• 48-2000 Tales from a Nonstandard Career in Operations Research , Michael H. Rothkopf
• 49-2000 On Convex Probabilistic Programming with Discrete Distributions , Darinka Dentcheva, Andras Prekopa and Andrzej Ruszczynski
• 50-2000 On maximum induced matchings in bipartite graphs , Vadim V. Lozin
• 51-2000 A Characterization of $\alpha_P$-Perfect Graphs , I. E. Zverovich and I. I. Zverovich
• 52-2000 On the number of inequalities describing a set of binary vectors , Bela Vizvari
• 53-2000 Difference Graphs , E. Boros, V. Gurvich and R. Meshulam
• 54-2000 An inequality limiting the number of maximal frequent sets , E. Boros, V. Gurvich, L. Khachiyan and K. Makino
• 55-2000 The Generalized OGY Method , Peter Majlender and Bela Vizvari
• 56-2000 P(3)-extension of a-polynomial classes , I. E. Zverovich and I. I. Zverovich
• 57-2000 Graph classes with bounded ratio of the stability number and the independent domination number , I. E. Zverovich and I. I. Zverovich
• 58-2000 An inverse-free directional Newton method for solving systems of nonlinear equations , Yuri Levin and Adi Ben-Israel
• 59-2000 Augmenting graphs for independent sets , Vladimir E. Alekseev and Vadim V. Lozin
• 60-2000 Finding intersection curves of surfaces via directional Newton method , Mikhail Nediak, Yuri Levin and Adi Ben-Israel
• 61-2000 A Practical General Approximation Criterion for Methods of Multipliers Based on Bregman Distances , Jonathan Eckstein

Back to RRR page

Last Modified: March 26, 2000