Country: United States

Found 17049 papers in total
Dynamic control of a queue with adjustable service rate
Dynamic control of a queue with adjustable service rate
2001,
We consider a single-server queue with Poisson arrivals, where holding costs are...
On mutually interfering parallel servers subject to external disturbances
On mutually interfering parallel servers subject to external disturbances
2001,
This paper considers a continuous-time non-Markovian parallel queueing system subject...
Waiting time analysis for a queueing system with time-limited service for exponential timer
Waiting time analysis for a queueing system with time-limited service for exponential timer
2001,
We consider a single-queue with exhaustive or gated time-limited services and server...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998,
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
Nonlinear Multiobjective Optimization
Nonlinear Multiobjective Optimization
2001,
Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory and Applications
Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory and Applications
2001,
Inverse optimization
Inverse optimization
2001,
In this paper, we study inverse optimization problems defined as follows. Let S denote...
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
1998,
The tree knapsack problem (TKP) is a generalized 0–1 knapsack problem where all...
Feasibility in transportation networks with supply eating arcs
Feasibility in transportation networks with supply eating arcs
1998,
In this paper, we consider a special case of a new type of mixed integer programming...
The assignment problem with external interactions
The assignment problem with external interactions
1997,
The classical assignment problem matches n jobs to n machines in a way that minimizes...
Performance of bucket brigades when work is stochastic
Performance of bucket brigades when work is stochastic
2001,
‘Bucket brigades’ are a way of sharing work on a flow line that results in...
Quantitative Analysis: An Introduction
Quantitative Analysis: An Introduction
2001,
On crossings, the crossing postman problem, and the rural postman problem
On crossings, the crossing postman problem, and the rural postman problem
1999,
The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing...
An efficient implementation of an algorithm for finding K shortest simple paths
An efficient implementation of an algorithm for finding K shortest simple paths
1999,
In this article, we present an efficient computational implementation of an algorithm...
Path problems in networks with vector-valued edge weights
Path problems in networks with vector-valued edge weights
1999,
We consider path problems in networks where each edge is associated with a vector of...
Upper and lower bounds for the average-case complexity of path-search
Upper and lower bounds for the average-case complexity of path-search
1999,
A channel graph is the union of all paths between a given input and a given output in...
The probabilistic longest path problem
The probabilistic longest path problem
1999,
We study the probabilistic longest path problem. We propose a modification strategy...
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
1998,
In this paper, we examine complexity issues, models, and algorithms for the problem of...
Solving the all-pair shortest path query problem on interval and circular-arc graphs
Solving the all-pair shortest path query problem on interval and circular-arc graphs
1998,
In this paper, we study the following all-pair shortest path query problem: Given the...
A new proximal decomposition algorithm for routing in telecommunication networks
A new proximal decomposition algorithm for routing in telecommunication networks
1998,
We present a new and much more efficient implementation of the proximal decomposition...
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
1998,
This paper presents an optimal dynamic programming algorithm, the first such algorithm...
On capacitated stochastic chain problems in a network
On capacitated stochastic chain problems in a network
1998,
This paper considers two basic problems relating to capacitated chains in a stochastic...
Euclidean Steiner minimum trees: An improved exact algorithm
Euclidean Steiner minimum trees: An improved exact algorithm
1997,
The Euclidean Steiner tree problem asks for a shortest network interconnecting a set...
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
1999,
In the minimum-cost strong network orientation problem (MCSO), we are given an...
Papers per page: