Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Found
97029 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
1989,
Wahl J. van der
It is shown that the throughput of a closed exponential queueing network is nondecreasing in the number of...
Response times in processor-shared queues with state-dependent arrival rates
1989,
Knessl C.
The authors consider M / M /1- PS queues where the arrival rate is a function of the instantaneous number...
Sojourn times in the M/G/1 queue with deterministic feedback
1989,
Berg J.L. van den
In this paper the authors consider an M / G /1 queueing model, in which each customer is fed back a fixed...
Fitting maps of the plane to experimental data
1989,
Noakes J.L.
This paper is motivated by the problem of fitting a differential equation to experimental data; a first...
On strong quasiconvex functions and boundedness of level sets
1989,
Jovanovic M.
It is shown that the level sets L ( x )={ y ∈ C ∈ f ( y )∈ f ( x )∈ are bounded for...
Theorems of the alternative for set-valued functions in infinite-dimensional spaces
1989,
Ferrero O.
In a recent paper a theorem of the alternative is stated for generalized systems of intersection type,...
Bimatroidal independence systems
1989,
Crama Y.
An independence system Σ =( X,F ) is called bimatroidal if there exist two matroids M =( X , F M )...
Absolute bounds on optimal cost for a class of set covering problems
1989,
Hall N.G.
The authors study the class of ( m constraint, n variable) set covering problems which have no more than k...
Restricted subset selection procedures for simulation
1989,
Sullivan David W.
This paper develops two procedures for screening a set of normal populations with unknown moments in order...
Reduced system algorithms for Markov chains
1988,
Lal Ram
A reduced system is a smaller system derived in the process of analyzing a larger system. In solving for...
A unified approach to adaptive control of average reward Markov decision processes
1988,
Hbner G.
The classical procedure for the adaptive control of average reward Markov decision processes with an...
Existence of optimal strategies in Markov chains with unknown parameter sequence
1988,
Sokolichin A.
Finite state controlled Markov chains with transition probabilities depending on a parameter are...
Individual call blocking probabilities in the loss systems SM+M/M/N and G+M/M/N
1988,
Willie Helmut
A method is derived for calculating the individual call blocking probabilities which arise when two...
Relaxations for the numerical solutions of some stochastic problems
1988,
Mitra Debasis
This paper is concerned with the systematic design of efficient Jacobi and Gauss-Seidel relaxations, and...
A throughput maximizing facility planning and layout model
1989,
Co H.
This paper presents a throughput-maximizing algorithm for facility planning and layout of flexible...
Solving a family of permutation problems on 0-1 matrices
1987,
Laporte Gilbert
This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling...
A limit theorem for (min,¸+) matrix multiplication
1988,
Saks Michael E.
A natural model for the sequential performance of tasks involves a system that can be configured into any...
Flows with piecewise linear convex cost function
1987,
Pasche C.
To solve network flow problems with piecewise linear convex cost function with efficiency, a specific...
Pre conservative minimal components of a Petri network: Structural study
1987,
Lemaire Bernard
A new notion in Petri nets is introduced: the ‘Minimal Preconservative Components’ (CPCM),...
Some observations on the EOQ models
1988,
Chitgopekar N.
This paper points out an interesting result relating to the total cost of the optimal policy for several...
Solution bases of multiterminal cut problems
1988,
Hassin Refael
Gomory and Hu proved that the ( n ab22 2 ) maxflow problems in an undirected network have at most n -1...
Designing a minimal spanning tree network subject to a budget constraint
1988,
Jrnsten K.
The problem of determining a minimal spanning tree, subject to side constraints, arises frequently in the...
A computational study of efficient shortest path algorithms
1988,
Hung Ming S.
Five efficient shortest path algorithms are implemented and compared in this report. The selected...
A new algorithm for the directed Chinese Postman Problem
1988,
Lin Yaxiong
The directed Chinese Postman Problem can be transformed into a minimum cost flow problem over a derived...
First Page
4018
4019
4020
4021
4022
Last Page
Papers per page:
8 Papers
16 Papers
24 Papers
32 Papers
48 Papers
Paper Filter
Search Text
Journals
Authors
Keywords
Countries
Year
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
Filter It!