Country: United States

Found 17049 papers in total
Interactive multicriteria linear programming: An extension of the method of Zionts and Wallenius
Interactive multicriteria linear programming: An extension of the method of Zionts and Wallenius
1989,
This article presents an extension of the interactive multicriteria linear-programming...
A new approach to the maximum-flow problem
A new approach to the maximum-flow problem
1988,
All previously known efficient maximum-flow algorithms work by finding augmenting...
As fast parametric maximum flow algorithm and applications
As fast parametric maximum flow algorithm and applications
1989,
The classical maximum flow problem sometimes occurs in settings in which the arc...
An improved primal simplex variant for pure processing networks
An improved primal simplex variant for pure processing networks
1989,
In processing networks, ordinary network constraints are supplemented by proportional...
An O(n2(m+nlogn)logn) min-cost flow algorithm
An O(n2(m+nlogn)logn) min-cost flow algorithm
1988,
The minimum-cost flow problem is: Given a network with n vertices and m edges, find a...
Maximizing classes of two-parameter objectives over matroids
Maximizing classes of two-parameter objectives over matroids
1989,
Let M =( N ,ℱ) be a matroid. Suppose that each element i in N is associated with...
Note on Weintraub’s minimum-cost circulation algorithm
Note on Weintraub’s minimum-cost circulation algorithm
1989,
In 1974 Weintraub published an algorithm for the minimum-cost circulation problems...
On the efficiency of maximum-flow algorithms on networks with small integer capacities
On the efficiency of maximum-flow algorithms on networks with small integer capacities
1989,
The performance of maximum-flow algorithms that work in phases is studied as a...
Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming
Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming
1989,
Computational experience is given for a sequential quadratic programming algorithm...
Optimal dynamic scheduling in Jackson networks
Optimal dynamic scheduling in Jackson networks
1989,
Considered is a Jackson-like network that supports J types of interactive traffic...
A quick simulation method for excessive backlogs in networks of queues
A quick simulation method for excessive backlogs in networks of queues
1989,
The authors consider stable open Jackson networks and study the rare events of...
Optimal service assignment in a finite-source queue
Optimal service assignment in a finite-source queue
1989,
The paper considers a dynamic scheduling problem of a finite-source M / M /1 system...
A linear programming problem in separable closed queueing networks
A linear programming problem in separable closed queueing networks
1989,
A separable closed queueing network is decomposed in two subnetworks, ℝ A and...
Decentralized control of service rates in a closed Jackson network
Decentralized control of service rates in a closed Jackson network
1989,
Consider a closed Jackson network with M nodes. The service rate at each node is...
The static property of a perturbed multiclass closed queueing network and decomposition
The static property of a perturbed multiclass closed queueing network and decomposition
1989,
Queueing networks can be viewed as dynamic systems. A small perturbation of an event...
Testing the validity of a queueing model of police patrol
Testing the validity of a queueing model of police patrol
1989,
This paper describes efforts to validate a multiple car dispatch queueing (MCD) model...
Algorithms for the design of finite-capacity service units
Algorithms for the design of finite-capacity service units
1989,
Finite-capacity queues arise naturally in many practical situations, notably in...
Duality and other results for M/G/1 and GI/M/1 queues, via a new ballot theorem
Duality and other results for M/G/1 and GI/M/1 queues, via a new ballot theorem
1989,
The authors generalize the classical ballot theorem and use it to obtain direct...
Life choices simulation: Model and methodology
Life choices simulation: Model and methodology
1988,
The life choices stimulation (LCS) is a computer-managed simulation which permits...
Single run optimization of discrete event simulations-An empirical study using the M/M/1 queue
Single run optimization of discrete event simulations-An empirical study using the M/M/1 queue
1989,
Simulation modeling has been widely used to analyze complex stochastic systems, such...
Insights from simulating JIT manufacturing
Insights from simulating JIT manufacturing
1989,
Computer simulation, used in the planning stage of a new AT&T electronic assembly...
On global costs and Nyquist’s theorem in random variate generation
On global costs and Nyquist’s theorem in random variate generation
1989,
This paper considers a large class of densities defined in terms of smoothness and...
Estimation for Dirichlet mixed models
Estimation for Dirichlet mixed models
1989,
Dirichlet mixed models find wide application. Estimation is usually achieved through...
Misapplications reviews: The mystery of the two-faced regression
Misapplications reviews: The mystery of the two-faced regression
1989,
Experienced regression analysts develop an awareness of the frailty of their results....
Papers per page: