Seminars
Research Reports
1993 RUTCOR Research Reports
-
ABSTRACTS
- 1-93
Knots, Colourings and the Complexity of Counting,
Dominic J. A. Welsh
(Available in printed form only)
- 2-93
Optimal Compression of Propositional Horn Knowledge Bases: Complexity
and Approximation,
Peter L. Hammer and Alexander Kogan
- 3-93
Estimation of Cause-Effect Relationship under Noise,
Andras Prekopa
- 4-93
Queueing in Space,
Eitan Altman and Hanoch Levy
- 5-93
A Sequence Of Servers With Arbitrary Input and Regular Service Times
Revisited (In Memory of Micha Yadin),
Benjamin Avi-Itzhak and Hanoch Levy
- 6-93
Servers in Tandem with $k$-stage Blocking and Communications
Type Flow,
Benjamin Avi-Itzhak
- 7-93
On the Optimality of Nested Partitions,
E. Boros and F. K. Hwang
- 8-93
Preliminary Computational Experience with Modified Log-Barrier
Functions for Large-Scale Nonlinear Programming,
Marc G. Breitfeld and David F. Shanno
- 9-93
Predicting Cause-Effect Relationships from Incomplete Discrete
Observations,
Endre Boros, Peter L. Hammer, and John N. Hooker
- 10-93
Quasi-Acyclic Propositional Horn Knowledge Bases:
Optimal Compression,
Peter L. Hammer and Alexander Kogan
- 11-93
Dual Subimplicants of Positive Boolean Functions,
Endre Boros, Vladimir Gurvich, and Peter L. Hammer
- 12-93
Unconstrained multilayer switchbox routing,
Endre Boros, Andras Recski, and Ferenc Wettl
- 13-93
The Duality of Resource Allocation Problem,
Wu Fang, Gao Ziyou, Lu Xinming, and Zhao Fuan
- 14-93
Onion Skins in Oriented Matroids,
Bert Gerards and Winfried Hochstattler
- 15-93
Computational Experience with General Equilibrium Problems,
A. Bachem, W. Hochstattler, B. Steckemetz and A. Volmer
- 16-93
Hamiltonicity in graphs with few $P_4$s,
W. Hochstattler and G.Tinhofer
- 17-93
Computational Experience with Modified Log-Barrier Methods for
Nonlinear Programming,
Marc G. Breitfeld and David F. Shanno
- 18-93
Computational Experience with Logarithmic Barrier Methods for Linear
and Nonlinear Complementarity Problems,
David F. Shanno
- 19-93
Computational Methods for Linear Programming,
David F. Shanno
- 20-93
Two Infeasible Interior-Point Predictor-Corrector Algorithms for
Linear Programming,
Jianming Miao
- 21-93
Exact Analysis of Bernoulli Superposition of Streams into a Least
Recently Used Cache,
Hanoch Levy and Robert J.T. Morris
- 22-93
When is a Circular Graph Minimally Imperfect?,
Endre Boros and Vladimir Gurvich
- 23-93
Minimization of Half-Products,
Tamas Badics and Endre Boros
- 24-93
Decompositions of Positive Self-Dual Boolean Functions,
Jan C. Bioch and Toshihide Ibaraki
- 25-93
Complexity of Identification and Dualization of Positive
Boolean Functions,
Jan C. Bioch and Toshihide Ibaraki
- 26-93
Generalization of the Tetrad Representation Theorem,
Glenn Shafer, Alexander Kogan and Peter Spirtes
- 27-93
Embedding Nonplanar Graphs in the Rectangular Grid,
Therese Biedl
- 28-93
Bipartite Dimensions and Bipartite Degrees of Graphs,
Peter C. Fishburn and Peter L. Hammer
- 29-93
An Extension of Nested Satisfiability,
Pierre Hansen, Brigitte Jaumard and Gerard Plateau
- 30-93
Bonds Fixed by Fixing Bonds,
Pierre Hansen and Maolin Zheng
- 31-93
A Quadratically Convergent $O((\kappa+1)\sqrt{n}L)$-iteration
Algorithm for the $P_*(\kappa)$-matrix Linear Complementarity
Problem,
Jianming Miao
- 32-93
Ordering of Tandem Constant-service Stations to Minimize
In-process Stock Cost,
Janice M. Kim and Benjamin Avi-Itzhak
- 33-93
A New Series of Dense Graphs of High Girth,
Felix Lazebnik, Vasiliy A. Ustimenko and Andrew J. Woldar
- 34-93
Bounds on Probabilities and Expectations
Using Multivariate Moments of Discrete Distributions,
Andras Prekopa
- 35-93
Programming Under Probabilistic Constraint and Maximizing a
Probability Under Constraints,
Andras Prekopa