Country: United States

Found 17049 papers in total
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...
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...
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...
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 nonlinear parametric search
On nonlinear parametric search
2001,
An alternative viewpoint for parametric search is presented, which achieves a bound...
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...
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 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...
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....
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...
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...
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...
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,...
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,...
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...
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...
Controlled Markov set-chains under average criteria
Controlled Markov set-chains under average criteria
2001,
In this paper, applying an interval arithmetic analysis, we consider the average case...
Steiner minimal trees with one polygonal obstacle
Steiner minimal trees with one polygonal obstacle
2001,
In this paper we study the Steiner minimal tree T problem for a point set Z with...
Optimal evasion from a pursuer with delayed information
Optimal evasion from a pursuer with delayed information
2001,
A class of prescribed duration pursuit–evasion problems with first-order...
An optimistic decision-making in fuzzy environment
An optimistic decision-making in fuzzy environment
2001,
Bellman and Zadeh have originated three systems of multistage decision processes in a...
Fuzzy multiple level programming
Fuzzy multiple level programming
2001,
The use of fuzzy set concept to overcome the computational difficulties of multi-level...
Maximizing the time spent by a diffusion process in an interval
Maximizing the time spent by a diffusion process in an interval
2001,
A one-dimensional diffusion process is controlled in the interval [−d, d]. The...
Waiting times at periodically switched one-way traffic lanes – a periodic, two-queue polling system with random setup times
Waiting times at periodically switched one-way traffic lanes – a periodic, two-queue polling system with random setup times
2001,
We study vehicle waiting times at a traffic lane that is shared by traffic from two...
On the existence of a variational principle for deterministic cellular automaton models of highway traffic flow
On the existence of a variational principle for deterministic cellular automaton models of highway traffic flow
2001,
It is shown that a variety of deterministic cellular automaton models of highway...
Papers per page: