Country: United States

Found 17049 papers in total
An intermittent fluid system with exponential on-times and semi-Markov input rates
An intermittent fluid system with exponential on-times and semi-Markov input rates
2001,
We consider a fluid system in which during off-times the buffer content increases as a...
Minimum-diameter covering problems
Minimum-diameter covering problems
2000,
A set V and a collection of (possibly nondisjoint) subsets are given. Also given is a...
A branch and cut method for the degree-constrained minimum spanning tree problem
A branch and cut method for the degree-constrained minimum spanning tree problem
2001,
A problem of interest in network design is that of finding, in a given weighted graph,...
Queues and hierarchies
Queues and hierarchies
2001,
This paper examines the optimal structure of hierarchies when workers differ in the...
Dynamic flows with supply and demand
Dynamic flows with supply and demand
2000,
We are given a network G = (N, A, h, c) with node set N, arch set A, time function h,...
Performance analysis of a server for facsimile communication networks
Performance analysis of a server for facsimile communication networks
2001,
We present a performance analysis of a multiaddress call extraction server. The...
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
2001,
In a multiperiod dynamic network flow problem, we model uncertain arc capacities using...
Optimal edge ranking of trees in linear time
Optimal edge ranking of trees in linear time
2001,
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are...
Approximation algorithms for degree-constrained minimum-cost network-design problems
Approximation algorithms for degree-constrained minimum-cost network-design problems
2001,
We study network-design problems with two different design objectives: the total cost...
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....
The full-degree spanning tree problem
The full-degree spanning tree problem
2000,
The full-degree spanning tree problem is defined as follows: Given a connected graph G...
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
2001,
In congested transportation and data networks, travel (or transmission) times are...
The capacitated arc routing problem with intermediate facilities
The capacitated arc routing problem with intermediate facilities
2001,
This article introduces the Capacitated Arc Routing with Intermediate Facilities...
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...
On the conversion of optimization problems with max–min constraints to standard optimization problems
On the conversion of optimization problems with max–min constraints to standard optimization problems
2001,
In this note, we obtain a sufficient and necessary condition for a point to be a local...
Minimization algorithms based on supervisor and searcher cooperation
Minimization algorithms based on supervisor and searcher cooperation
2001,
In the present work, we explore a general framework for the design of new minimization...
The application of automated reasoning to formal models of combinatorial optimization
The application of automated reasoning to formal models of combinatorial optimization
2001,
Many formalisms have been proposed over the years to capture combinatorial...
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...
Availability of continuous service and computing long-run mean time between failures and reliability for Markov systems
Availability of continuous service and computing long-run mean time between failures and reliability for Markov systems
2001,
Steady-state availability has long been a popular descriptor of effectiveness for...
Computing average optimal constrained policies in stochastic dynamic programming
Computing average optimal constrained policies in stochastic dynamic programming
2001,
A stochastic dynamic program incurs two types of cost: a service cost and a quality of...
Existence of optimal stationary policies in finite dynamic programs with nonnegative rewards – an alternative approach
Existence of optimal stationary policies in finite dynamic programs with nonnegative rewards – an alternative approach
2001,
This article concerns Markov decision chains with finite state and action spaces, and...
A second-order necessary condition for fractional programming
A second-order necessary condition for fractional programming
2001,
A treatment for multiobjective fractional programming problem has been given where use...
Papers per page: