Country: United States

Found 17049 papers in total
Approximation of multiclass queuing networks with highly variable arrivals under deterministic routing
Approximation of multiclass queuing networks with highly variable arrivals under deterministic routing
2005,
In this paper, we present the heavy-traffic bottleneck phenomenon under multiclass...
An eigenvalue approach to discrete-time MAP/G/1 queues
An eigenvalue approach to discrete-time MAP/G/1 queues
2003,
In this paper, we demonstrate how one can effectively analyze the operational behavior...
An algorithm to compute the waiting time distribution for the M/G/1 queue
An algorithm to compute the waiting time distribution for the M/G/1 queue
2004,
In many modern applications of queueing theory, the classical assumption of...
The Hungarian Method for the assignment problem
The Hungarian Method for the assignment problem
2005,
Assuming that numerical scores are available for the performance of each of n persons...
Statement for Naval Research Logistics
Statement for Naval Research Logistics
2005,
On Kuhn's Hungarian Method – A tribute from Hungary
On Kuhn's Hungarian Method – A tribute from Hungary
2005,
Harold W. Kuhn, in his celebrated paper entitled ‘The Hungarian Method for the...
Generalized networks: The theory of preprocessing and an empirical analysis
Generalized networks: The theory of preprocessing and an empirical analysis
2004,
The idea of preprocessing a linear program with the goal of eliminating constraints or...
Implementing an LU factorization for the embedded network simplex algorithm
Implementing an LU factorization for the embedded network simplex algorithm
2004,
This paper presents an LU factorization specialized for embedded network simplex...
A heuristic genetic algorithm for solving complex safety-based work assignment problems
A heuristic genetic algorithm for solving complex safety-based work assignment problems
2005,
This paper presents a heuristic genetic algorithm (GA) for finding the work...
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
2004,
This paper focuses on the continuous assignment problem with the eventual aim to solve...
An ejection chain approach for the generalized assignment problem
An ejection chain approach for the generalized assignment problem
2004,
We propose a tabu search algorithm for the generalized assignment problem, which is...
The simple assembly line balancing problem with parallel workstations – A simulated annealing approach
The simple assembly line balancing problem with parallel workstations – A simulated annealing approach
2001,
This work presents a new mathematical programming model for the simple assembly line...
Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning
Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning
2005,
Sequential estimation and crashing in PERT networks with statistical dependence
Sequential estimation and crashing in PERT networks with statistical dependence
2003,
We review a framework for learning-based estimation and dynamic decision in PERT...
A multiple pairs shortest path algorithm
A multiple pairs shortest path algorithm
2005,
The multiple pairs shortest path problem (MPSP) arises in many applications where the...
Updating paths in time-varying networks given arc weight changes
Updating paths in time-varying networks given arc weight changes
2005,
Many transportation applications, including applications in intelligent transportation...
Finding the Kth shortest path in a time-schedule network
Finding the Kth shortest path in a time-schedule network
2005,
We consider the problem of finding the K th shortest path for a time-schedule network,...
Flow assignment of a stochastic flow network with multiple node pairs
Flow assignment of a stochastic flow network with multiple node pairs
2003,
This article mainly generalizes the flow problem for a stochastic flow network from...
Quantifying optimal mesh and ring design costs
Quantifying optimal mesh and ring design costs
2005,
During the last decade telecommunication operators have been deploying WDM (Wavelength...
A generalization of the weighted set covering problem
A generalization of the weighted set covering problem
2005,
We study a generalization of the weighted set covering problem where every element...
Shock model in Markovian environment
Shock model in Markovian environment
2005,
A Markov modulated shock model is studied in this paper. In this model, both the...
The profitable arc tour problem: Solution with a branch-and-price algorithm
The profitable arc tour problem: Solution with a branch-and-price algorithm
2005,
In this article, we introduce a new arc routing problem that we call the profitable...
A branch-and-price approach for the maximum weight independent set problem
A branch-and-price approach for the maximum weight independent set problem
2005,
The maximum weight-independent set problem (MWISP) is one of the most well-known and...
Maximal vertex-connectivity of Sn,k
Maximal vertex-connectivity of Sn,k
2005,
The class of star graphs is a popular topology for interconnection networks. However,...
Papers per page: