Keyword: computational analysis

Found 489 papers in total
Internet-type queues with power-tailed interarrival times and computational methods for their analysis
Internet-type queues with power-tailed interarrival times and computational methods for their analysis
2000,
Internet traffic flows have often been characterized as having power-tailed...
Minmax regret median location on a network under uncertainty
Minmax regret median location on a network under uncertainty
2000,
We consider the 1-median problem on a network with uncertain weights of nodes....
Algorithms for path-based placement of inspection stations on networks
Algorithms for path-based placement of inspection stations on networks
2000,
Placement of inspection stations is a common task in transportation and communication...
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
2000,
We derive results of the following flavor: If a combinatorial optimization problem can...
A minimal algorithm for the bounded knapsack problem
A minimal algorithm for the bounded knapsack problem
2000,
The Bounded Knapsack Problem (BKP) is a generalization of the 0–1 Knapsack...
A new algebraic geometry algorithm for integer programming
A new algebraic geometry algorithm for integer programming
2000,
We propose a new algorithm for solving integer programming (IP) problems that is based...
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
2000,
Postoptimality or sensitivity analysis are well-developed subjects in almost all...
Dimension of valued relations
Dimension of valued relations
2000,
The classical notion of dimension of a partial order can be extended to the valued...
An assurance interval for the non-Archimedean epsilon in data envelopment analysis (DEA) models
An assurance interval for the non-Archimedean epsilon in data envelopment analysis (DEA) models
2000,
This paper clarifies the role of non-Archimedean infinitesimal ε in DEA models so...
A structure-exploiting tool in algebraic modeling languages
A structure-exploiting tool in algebraic modeling languages
2000,
A new concept is proposed for linking algebraic modeling languages with...
On the single-assignment p-hub center problem
On the single-assignment p-hub center problem
2000,
We study the computational aspects of the single-assignment p -hub center problem on...
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
1998,
We investigate a single-machine scheduling problem with precedence delays that have a...
Stability in P5- and banner-free graphs
Stability in P5- and banner-free graphs
2000,
We prove polynomial solvability of the maximum stable set problem in P 5 -free...
The 2-hop spanning tree problem
The 2-hop spanning tree problem
1998,
A spanning tree in a graph G where each node has distance at most 2 from a root node r...
Calculation of stability radii for combinatorial optimization problems
Calculation of stability radii for combinatorial optimization problems
1998,
We present algorithms to calculate the stability radius of optimal or approximate...
An adaptive time slot assignment algorithm for variable bandwidth switching systems
An adaptive time slot assignment algorithm for variable bandwidth switching systems
2000,
In this paper, we consider an optimal (i.e., minimum scheduling length) time slot...
The computational complexity of a bin packing game
The computational complexity of a bin packing game
1994,
In this paper we investigate the following game: two players I and II must alternately...
A comment on a minmax location problem
A comment on a minmax location problem
1998,
In a recent paper Hamacher and Schobel study a minmax location problem in the...
Framework for change notification and view synchronization in distributed model management systems
Framework for change notification and view synchronization in distributed model management systems
1999,
Large-scale model management systems are increasingly in demand to support groups of...
Computing performance measures in a multi-class multi-resource processor-shared loss system
Computing performance measures in a multi-class multi-resource processor-shared loss system
2000,
This paper develops methods to compute performance measures in a specific type of loss...
Storage management of items in two levels of availability
Storage management of items in two levels of availability
2000,
This paper is concerned with the problem of storage management of non-consumable items...
Scheduling with batching: A review
Scheduling with batching: A review
2000,
There is an extensive literature on models that integrate scheduling with batching...
Complexity of mixed shop scheduling problems: A survey
Complexity of mixed shop scheduling problems: A survey
2000,
We survey recent results on the computational complexity of mixed shop scheduling...
Minimizing functions of infeasibilities in a two-machine flow shop
Minimizing functions of infeasibilities in a two-machine flow shop
2000,
We consider a class of schedules obtained in the following way. In a schedule of...
Papers per page: