Country: United States

Found 17049 papers in total
Ito’s formula with respect to fractional Brownian motion and its application
Ito’s formula with respect to fractional Brownian motion and its application
1996,
Fractional Brownian motion (FBM) with Hurst index 1/2< H<1 is not a...
Toward a taxonomy of parallel tabu search heuristics
Toward a taxonomy of parallel tabu search heuristics
1997,
In this paper the authors present a classification of parallel tabu search...
On the use of the power series algorithm for general Markov processes, with an application to a Petri net
On the use of the power series algorithm for general Markov processes, with an application to a Petri net
1997,
The power series algorithm has been developed as numerical procedure for solving...
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
1996,
The authors consider a 2-approximation algorithm for Euclidean minimum-cost perfect...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996,
The authors propose an algorithm to solve the bottleneck spanning tree problem with an...
Localizing and diagnosing infeasibilities in networks
Localizing and diagnosing infeasibilities in networks
1996,
Network models are among the largest linear programs solved, but formulation can be a...
Some experimental and theoretical results on test case generators for the maximum clique problem
Some experimental and theoretical results on test case generators for the maximum clique problem
1996,
The authors describe and analyze test case generators for the maximum clique problem...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996,
This paper deals with a Steiner tree-star problem that is a special case of the degree...
The multi-tier tree problem
The multi-tier tree problem
1996,
This paper studies the multi-tier tree (MTT) problem, a generalization of the...
Experience with a cutting plane algorithm for the capacitated spanning tree problem
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
A basic problem in telecommunications network design is that of designing a...
Multicommodity flows in ring networks
Multicommodity flows in ring networks
1996,
In this paper, the authors consider the problem of multicommodity flows on a ring...
Capacitated network design-Polyhedral structure and computation
Capacitated network design-Polyhedral structure and computation
1996,
The authors study a capacity expansion problem that arises in telecommunication...
An improved algorithm for approximating the performance of stochastic flow networks
An improved algorithm for approximating the performance of stochastic flow networks
1996,
A problem encountered in the analysis of communication and other distribution systems...
Methodology for stochastic graph completion-time problems
Methodology for stochastic graph completion-time problems
1996,
Assume a completion time T 0 and a graph having edges with randomly chosen weights are...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996,
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
On the Laguerre method for numerically inverting Laplace transforms
On the Laguerre method for numerically inverting Laplace transforms
1996,
The Laguerre method for numerically inverting Laplace transforms is an old established...
Stopping criteria for finite length genetic algorithms
Stopping criteria for finite length genetic algorithms
1996,
Considerable empirical results have been reported on the computational performance of...
Optimizing multinomial logit profit functions
Optimizing multinomial logit profit functions
1996,
The multinomial logit model is a standard approach for determining the probability of...
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997,
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
A branch-and-bound approach using polyhedral results for a clustering problem
A branch-and-bound approach using polyhedral results for a clustering problem
1997,
This article describes a variation of the branch and bound method for solving a...
Art Gallery problems for convex nested polygons
Art Gallery problems for convex nested polygons
1997,
In this article, the authors study a class of Art Gallery problems that are defined on...
A new knapsack solution approach by integer equivalent aggregation and consistency determination
A new knapsack solution approach by integer equivalent aggregation and consistency determination
1997,
The authors present a new and highly efficient algorithm for the integer knapsack...
A column generation approach for graph coloring
A column generation approach for graph coloring
1996,
The authors present a method for solving the independent set formulation of the graph...
An implementation of LPFORM
An implementation of LPFORM
1996,
This paper describes a Microsoft Windows-based system, LP-FORM, that uses a graphical...
Papers per page: