Keyword: computational analysis

Found 489 papers in total
Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem
Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem
1991,
The paper studies the number of pivots required by the primal network simplex...
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
1991,
The authors analyze probabilistically the classical Held-Karp lower bound derived from...
A branch-and-cut approach to a traveling salesman problem with side constraints
A branch-and-cut approach to a traveling salesman problem with side constraints
1989,
A problem posed by O.L. Deutsch as the Artificial Intelligence Design Challenge for...
A computational comparison of the network simplex method with the dual affine scaling method
A computational comparison of the network simplex method with the dual affine scaling method
1991,
The authors compare the performance of an implementation of dual affine scaling method...
An efficient integer labeling method for solving systems of nonlinear equations with separable mappings
An efficient integer labeling method for solving systems of nonlinear equations with separable mappings
1989,
Homotopy methods are known to be globally convergent algorithms for solving systems of...
Parallel processing and OR/MS
Parallel processing and OR/MS
1991,
Parallel processing has moved in recent years from a largely theoretical issue to the...
Performance of shortest path algorithms in network flow problems
Performance of shortest path algorithms in network flow problems
1990,
It is known that minimum cost flow problems can be solved by successive augmentations...
Finding minimum-cost circulations by successive approximation
Finding minimum-cost circulations by successive approximation
1990,
The authors develop a new approach to solving minimum-cost circulation problems. The...
Simplicial decomposition for convex generalized networks
Simplicial decomposition for convex generalized networks
1990,
The simplicial decomposition algorithm is specialized to solve nonlinear programs with...
A minimum time algorithm for the graph construction and the leader election problems in a distributed system
A minimum time algorithm for the graph construction and the leader election problems in a distributed system
1989,
Given an asynchronous distributed system with an arbitrary topology, in which each...
On a network design problem that is intractable on trees
On a network design problem that is intractable on trees
1990,
In this paper the authors study an optimization problem that arises in the design of...
A modeling language for mathematical programming
A modeling language for mathematical programming
1990,
Practical large-scale mathematical programming involves more than just the application...
Lumberproduction optimization
Lumberproduction optimization
1989,
An algorithm is developed to optimize the conversion of trees into lumber. The...
A computational study of single constrained EOQ inventory systems
A computational study of single constrained EOQ inventory systems
1988,
Tight bounds to the optimal Lagrange multiplier for two item deterministic inventory...
Heuristic least-cost computation of discrete classification functions with uncertain argument values
Heuristic least-cost computation of discrete classification functions with uncertain argument values
1989,
The authors consider the problem of minimizing the expected cost of computing the...
A probabilistic analysis of the switching algorithm for the Euclidean TSP
A probabilistic analysis of the switching algorithm for the Euclidean TSP
1989,
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean...
Minmax linear programmes with grouped variables
Minmax linear programmes with grouped variables
1989,
The authors consider an optimization problem in which Max[ c j x j...
Recognition problems for special classes of polynomials in 0-1 variables
Recognition problems for special classes of polynomials in 0-1 variables
1989,
This paper investigates the complexity of various recognition problems for...
New efficient cluster identification algorithms
New efficient cluster identification algorithms
1989,
New efficient cluster identification algorithms are presented for binary matrices. The...
Optimal product design using conjoint analysis: Computational complexity and algorithms
Optimal product design using conjoint analysis: Computational complexity and algorithms
1989,
The problem of maximizing the share of a new product introduced in a competitive...
Scheduling jobs on a single machine with periodic release date/deadline intervals
Scheduling jobs on a single machine with periodic release date/deadline intervals
1989,
The problem of scheduling jobs on a single machine with a given set of release...
Worst-case analysis of an approximation algorithm for flow-shop scheduling
Worst-case analysis of an approximation algorithm for flow-shop scheduling
1989,
A worst-case analysis of an algorithm proposed by Campbell et al. for the m- machine...
Performance analysis of an integrated services switch
Performance analysis of an integrated services switch
1989,
The queueing performance of a single server packet-switched system serving two...
Numerical solution of sparse singular systems of equations arising from ergodic Markov chains
Numerical solution of sparse singular systems of equations arising from ergodic Markov chains
1989,
The stationary probability distribution vector, x , associated with an ergodic finite...
Papers per page: