Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Hungary
Found
107 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A multivariate utility function
2004,
Prkopa Andrs
A univariate utility function u(z ) is usually required to satisfy the conditions u...
New variants of the criss-cross method for linear complementarity problems with bisymmetric matrices
2004,
Ills Tibor
In this paper, S. Zhang's new and more flexible criss-cross type pivot rule is...
A heuristic algorithm for the quadratic assignment problem
2002,
Borgulya Istvn
In this paper we describe a new evolutionary algorithm for the Quadratic Assignment...
The rank-reduction algorithm of Egerváry and its application
2002,
Galntai Aurl
The history and applications of the rank-reduction algorithm of Egerváry is...
The possibility of application MC2 programming in the aggregate production planning
2001,
Gyetvn Ferenc
This paper gives a summary of aggregate production planning with multiple objective...
Lower and upper bounds for the expected time to failure of systems
2004,
Prkopa Andrs
In large series-parallel systems the exact calculation of the expected time to failure...
Risk aversion under presence of multiple sources of risk
2001,
Varga Jzsef
Sufficient conditions to guarantee properness and weak properness properties in the...
A new approach of price expectations
2001,
Vizvri Bla
A new market model is provided which describes the uncertainty of the estimations by...
Data envelopment analysis for evaluating the efficiency of industrial parks in Hungary
2001,
Flp Jnos
The paper reports on the results of a project for evaluating the efficiency of...
Early appearance of generalized monotonicity in microeconomics
2001,
Komlsi Sndor
Generalized monotonicity is a very useful property of maps figuring in complementarity...
Evaluation of the tender for developing the economy in Hungary
2001,
Rapcsk Tams
The evaluation of the efficiency of the Tender for Developing the Economy in Hungary...
Public goods and corruption in the Ramsey model
2001,
Bessenyei Istvn
This paper discusses the effect upon economic growth of corruption in the...
Mining dynamic databases by weighting
2003,
Liu Li
A dynamic database is a set of transactions, in which the content and the size can...
Endowment game and optimal total quantity in artificial markets
2002,
Ujhelyi Gergely
The paper deals with two key issues related to the creation of artificial markets:...
On variable sized vector packing
2003,
Epstein Leah
One of the open problems in on-line packing is the gap between the lower bound...
On-line maximizing the number of items packed in variable-sized bins
2003,
Epstein Leah
We study on-line bin packing problem. A fixed number of n . of bins, possibly of...
Some polynomial programming problems solving with a clustering algorithm
2000,
Borgulya Istvn
In my study I describe an optimum search clustering algorithm and I demonstrate its...
Probability bounds given by hypercherry trees
1999,
Szntai Tams
In the paper new bounds are given for the probability of the union of events. For this...
Probability bounds given by multitrees
2000,
Bukszr Jzsef
Upper bounds are presented for the probability of the union of finite number of...
Mathematical statistical characterization of high-speed computer network traffic data
1999,
Gl Zoltn
The studying of high-speed networks is an actual problem in both fields of modeling of...
Gradient method in Sobolev spaces: Approximate solution of linear boundary value problems using polynomials
1999,
Kartson Jnos
The subject of the paper is the application of the Hilbert space version of the...
A label-setting algorithm for calculating shortest path trees in sparse networks
1999,
Marton Lszl
Shortest path analysis is a major analytical component of numerous quantitative...
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
1999,
Dsa Gyrgy
We are dealing with a problem of one-resource-constrained scheduling: How can a number...
Generalized multifit-type methods for scheduling parallel identical machines
1999,
Dsa Gyrgy
We investigate a very well known NP-complete problem of the scheduling-theory:...
First Page
1
2
3
4
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers