Country: United States

Found 17049 papers in total
Balanced network flows. V. Cycle-canceling algorithms
Balanced network flows. V. Cycle-canceling algorithms
2001,
We discuss Anstee's approach for solving generalized matching problems by solving an...
Balanced network flows. VI. Polyhedral descriptions
Balanced network flows. VI. Polyhedral descriptions
2001,
This paper discusses the balanced circulation polytope, that is, the convex hull of...
Reconstructing a minimum spanning tree after deletion of any node
Reconstructing a minimum spanning tree after deletion of any node
2001,
Updating a minimum spanning tree (MST) is a basic problem for communication networks....
Characterization results of all shortest paths interval routing schemes
Characterization results of all shortest paths interval routing schemes
2001,
We give complete characterizations for the classes of graphs with uniform cost links...
On nonlinear parametric search
On nonlinear parametric search
2001,
An alternative viewpoint for parametric search is presented, which achieves a bound...
Uncertain programming: A unifying optimization theory in various uncertain environments
Uncertain programming: A unifying optimization theory in various uncertain environments
2001,
By uncertain programming we mean the optimization theory in generally uncertain...
A class of dual fuzzy dynamic programs
A class of dual fuzzy dynamic programs
2001,
In this paper we propose a large class of fuzzy dynamic programs. By use of the notion...
Nondeterministic dynamic programming on a parallel coprocessing system
Nondeterministic dynamic programming on a parallel coprocessing system
2001,
We describe how nondeterministic dynamic programming (DP) algorithms can be designed...
Monitoring and control of anytime algorithms: A dynamic programming approach
Monitoring and control of anytime algorithms: A dynamic programming approach
2001,
Anytime algorithms offer a tradeoff between solution quality and computation time that...
An efficient model of neural networks for dynamic programming
An efficient model of neural networks for dynamic programming
2001,
Systems based on artificial neural networks have high computational rates owing to the...
A dynamic programming algorithm for the optimal control of piecewise deterministic Markov processes
A dynamic programming algorithm for the optimal control of piecewise deterministic Markov processes
2001,
A piecewise deterministic Markov process is a continuous time Markov process...
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
Efficient algorithms for integer programs with two variables per constraint
Efficient algorithms for integer programs with two variables per constraint
2001,
Given a bounded integer program with n variables and m constraints, each with two...
A branch and bound algorithm for designing reliable systems at a minimum cost
A branch and bound algorithm for designing reliable systems at a minimum cost
2001,
A nonlinear integer programming model for the optimal design of a series/parallel...
Exact algorithms for linear programming over algebraic extensions
Exact algorithms for linear programming over algebraic extensions
2001,
We study the computational complexity of linear programs with coefficients that are...
Fuzzy multiple level programming
Fuzzy multiple level programming
2001,
The use of fuzzy set concept to overcome the computational difficulties of multi-level...
Fuzzy linear programming problems as bi-criteria optimization problems
Fuzzy linear programming problems as bi-criteria optimization problems
2001,
In this paper, we consider fuzzy linear programming (FLP) problems which involve fuzzy...
An interactive graphic presentation for multiobjective linear programming
An interactive graphic presentation for multiobjective linear programming
2001,
In this paper we examine the design and implementation issues relating to the search...
A simple and high performance neural network for quadratic programming problems
A simple and high performance neural network for quadratic programming problems
2001,
In this paper, a neural network for quadratic programming problems is simplified. The...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001,
In this paper the problem of efficiently serving a sequence of requests presented in...
A matrix analytic solution to a hysteretic queueing system with random server capacity
A matrix analytic solution to a hysteretic queueing system with random server capacity
2001,
An r-quorum queueing system under N-policy discipline is considered. The service...
On a single server queue with two-stage heterogeneous service and deterministic server vacations
On a single server queue with two-stage heterogeneous service and deterministic server vacations
2001,
We analyse a single server queue with Poisson arrivals, two stages of heterogeneous...
Stability of networks and protocols in the adversarial queueing model for packet routing
Stability of networks and protocols in the adversarial queueing model for packet routing
2001,
The adversarial queueing theory model for packet routing was suggested by Borodin et...
Sequencing and routing in multiclass queueing networks part I: Feedback regulation
Sequencing and routing in multiclass queueing networks part I: Feedback regulation
2001,
This paper establishes new criteria for stability and for instability of multiclass...
Papers per page: