2001 RUTCOR Research Reports

• ABSTRACTS

• 1-2001 Modeling Opportunities in Auctions , Michael H. Rothkopf
• 2-2001 An Elementary Introduction to Auctions , Michael H. Rothkopf and Sunju Park
• 3-2001 Auctions with Endogenously Determined Allowable Combinations , Sunju Park and Michael H. Rothkopf
• 4-2001 Bounding the Probability of the Union of Events by the Use of Aggregation and Disaggregation in Linear Programs , Andras Prekopa, Bela Vizvari, Gabor Regos and Linchun Gao
• 5-2001 On the Concavity of Multivariate Probability Distribution Functions , Andras Prekopa
• 6-2001 Lower and Upper Bounds for the Probability that at Least r and Exactly r out of n Events Occur , Linchun Gao and Andras Prekopa
• 7-2001 Pareto-Optimal Patterns in Logical Analysis of Data , Peter L. Hammer, Alexander Kogan, Bruno Simeone, and Sandor Szedmak
• 8-2001 Control of Market Power in Electricity Auctions , Michael H. Rothkopf
• 9-2001 An attractive class of bipartite graphs , Rodica Boliac and Vadim V. Lozin
• 10-2001 Dual Stochastic Dominance and Related Mean--Risk Models , W. Ogryczak and A. Ruszczynski
• 11-2001 Weighted well-covered graphs and complexity questions , Igor Zverovich
• 12-2001 Finding a maximum stable set in pentagraphs , I. E. Zverovich and I. I. Zverovich
• 13-2001 Splitoids , Peter L. Hammer and Igor E. Zverovich
• 14-2001 Extension of hereditary classes with substitutions , Igor Zverovich
• 15-2001 Strong Embeddings of Planar Near-triangulations on Non-orientable Surfaces , Tongyin Liu and Yanpei Liu
• 16-2001 A Branch and Bound Method for Stochastic Integer Problems under Probabilistic Constraints , Patrizia Beraldi and Andrzej Ruszczynski
• 17-2001 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.
• 18-2001 The reducing copath method for specific homogeneous sets , Igor Zverovich
• 19-2001 The reducing copath method for simple homogeneous sets , I. E. Zverovich and I. I. Zverovich
• 20-2001 Bipartite graphs without a skew star , Vadim V. Lozin
• 21-2001 A finiteness theorem for primal extensions , Igor Zverovich
• 22-2001 Extended (P5, ~P5)-free graphs , I. E. Zverovich and I. I. Zverovich
• 23-2001 A characterization of domination reducible graphs , I. E. Zverovich and I. I. Zverovich
• 24-2001 A Characterization of superbipartite graphs , I. E. Zverovich and I. I. Zverovich
• 25-2001 Scheduling of Data Transcription in Periodically Connected Databases , Avigdor Gal and Jonathan Eckstein
• 26-2001 Remarks on the Concept of Robust Algorithm , Herbert Fleischner, Stephan Foldes and Stefan Szeider
• 27-2001 YASAI: Yet Another Add-In for Teaching Elementary Monte Carlo Simulation in EXCEL , Jonathan Eckstein and Steven T. Riedmueller
• 28-2001 Extension of claw-free graphs and (K1 U P4)-free graphs with substitutions , Andreas Brandstadt, Chinh Hoang and Igor Zverovich
• 29-2001 On the linear structure and clique-width of bipartite permutation graphs , Andreas Brandstadt and Vadim V. Lozin
• 30-2001 Maximization of Quadratic Posiforms Corresponding to 2-Paths of a Directed Multigraph , Igor Zverovich
• 31-2001 On computing the dissociation number of bipartite graphs , Rodica Boliac and Vadim V. Lozin
• 32-2001 The Probabilistic Set Covering Problem , Patrizia Beraldi and Andrzej Ruszczynski
• 33-2001 Minimum degree algorithms for stability number , Igor Zverovich
• 34-2001 Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach , Avigdor Gal and Jonathan Eckstein
• 35-2001 A Tchebycheff DEA model , Gabriel Tavares and Carlos Henggeler Antunes
• 36-2001 A Heuristic Method for Multifacility Location Problems , Yuri Levin and Adi Ben-Israel
• 37-2001 Non-Robustness of Class-Specific Efficient Optimization Algorithms on Oracle-Specified Set Functions , Stephan Foldes
• 38-2001 Forbidden subsystem characterization of matroids and applications to classes of matroid generating graphs , Igor E. Zverovich
• 39-2001 3-Colorability in P for P6-free Graphs , Bert Randerath and Ingo Schiermeyer
• 40-2001 A Satisfiability Formulation of Problems on Level Graphs , Endre Boros, Ondrej Cepek, Peter Hammer, Alex Kogan, Kazuhisa Makino, Bert Randerath, Bruno Simeone and Ewald Speckenmeyer
• 41-2001 Disjunctive Analogues of Submodular and Supermodular Functions , Stephan Foldes and Peter L. Hammer
• 42-2001 Slow Dutch Auctions , Octavian Carare and Michael Rothkopf
• 43-2001 Remarks on multifunction-based dynamical systems , Gergely Kovacs, Marian Muresan and Bela Vizvari
• 44-2001 On Performance Prediction of Cellular Telephone Networks , Linchun Gao and Andras Prekopa
• 45-2001 Level Decomposition: Adapting an Approximate Level Method to the Two-Stage Stochastic Programming Problem , Csaba I. Fabian
• 46-2001 Stable sets in two subclasses of banner-free graphs , Michael U. Gerber, Alain Hertz and Vadim V. Lozin
• 47-2001 On 3-Simplicial Vertices in Planar Graphs , Endre Boros, Robert E. Jamison, Renu Laskar and Henry Martyn Mulder
• 48-2001 Pseudo-Boolean Optimization , Endre Boros and Peter L. Hammer
• 49-2001 How to find more efficient initial solution for searching? , Sandor Szedmak
• 50-2001 Forbidden Induced Subgraph Characterization of Cograph Contraction , I. E. Zverovich and I. I. Zverovich
• 51-2001 Second-Order Cone Programming , F.Alizadeh and D.Goldfarb
• 52-2001 Heretical Thoughts on The design of Combinatorial Auctions for the FCC , Michael H. Rothkopf
• 53-2001 Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming , Mikhail Nediak and Jonathan Eckstein
• 54-2001 Optimizing production supply and distribution for General Chemical , DeLyle Bloomquist, David Graziosi, Lei Lei, Andrzej Ruszczynski, Shuguang Liu and Hua Zhong
• 55-2001 An augmenting graph approach to the stable set problem in $P_5$-free graphs , Rodica Boliac and Vadim V. Lozin
• 56-2001 A Stochastic Programming Model for Optical Fiber Manufacturing , Csaba I. Fabian, Richard Nemedi and Zoltan Szoke
• 57-2001 A Heuristic Algorithm for Finding Circuits to Double Cover A Bridgeless Graph , Tongyin Liu
• 58-2001 Conditions on Maitaining State Consistency in Heterogeneous Groupware , Ivan Marsic and Tongyin Liu
• 59-2001 Accelerated Algorithm for Pattern Detection in Logical Analysis of Data , Sorin Alexe and Peter L. Hammer
• 60-2001 On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles , Endre Boros and Vladimir Gurvich

Back to RRR page