Country: United States

Found 17049 papers in total
Packet routing in telecommunication networks with path and flow restrictions
Packet routing in telecommunication networks with path and flow restrictions
1999,
We address packet-switched telecommunication networks, including ATM, SMDS, and X.25...
Heuristics for distribution network design in telecommunication
Heuristics for distribution network design in telecommunication
2000,
A distribution network problem arises in a lower level of a hierarchical modelling...
Linear programming-based heuristic algorithms for interconnecting token rings via source routing bridges
Linear programming-based heuristic algorithms for interconnecting token rings via source routing bridges
2000,
We develop a method to determine the topology of a network that interconnects a number...
On minimum congestion routing in rearrangeable multihop lightwave networks
On minimum congestion routing in rearrangeable multihop lightwave networks
1995,
In this article we consider the problem of minimizing the congestion in logically...
An efficient decomposition algorithm to optimize spare capacity in a telecommunications network
An efficient decomposition algorithm to optimize spare capacity in a telecommunications network
1999,
This article presents a new model for the spare capacity allocation problem in a...
An optimal algorithm for Euclidean shortest paths in the plane
An optimal algorithm for Euclidean shortest paths in the plane
1999,
We propose an optimal-time algorithm for a classical problem in plane computational...
Reducing costs of backhaul networks for personal communications services networks using genetic algorithms
Reducing costs of backhaul networks for personal communications services networks using genetic algorithms
1996,
Designing cost-effective telecommunications networks often involves solving several...
Design of stacked self-healing rings using a genetic algorithm
Design of stacked self-healing rings using a genetic algorithm
2000,
Ring structures in telecommunications are taking on increasing importance because of...
Heuristics, linear programs, and trees on trees: Network design analyses
Heuristics, linear programs, and trees on trees: Network design analyses
1996,
We study a class of models, known as overlay optimization problems, composed of...
A flow algorithm for network synchronization
A flow algorithm for network synchronization
1996,
The problem we treat is defined on a graph where each node is associated with a...
A scatter-search-based learning algorithm for neural network training
A scatter-search-based learning algorithm for neural network training
1996,
In this article, we propose a new scatter-search-based learning algorithm to train...
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
1999,
During the last five years, several methods have been proposed for handling nonlinear...
Industrial Applications of Combinatorial Optimization
Industrial Applications of Combinatorial Optimization
1999,
The OPL Optimization Programming Language
The OPL Optimization Programming Language
1999,
Exact solution of the quadratic knapsack problem
Exact solution of the quadratic knapsack problem
1999,
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective...
Computing minimum-weight perfect matchings
Computing minimum-weight perfect matchings
1999,
We make several observations on the implementation of Edmonds' blossom algorithm for...
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
1995,
The convergence of the simulated annealing algorithm is accelerated by a probabilistic...
Applying simulated annealing to location-planning models
Applying simulated annealing to location-planning models
1996,
Simulated annealing is a computational approach that simulates an annealing schedule...
Numerical computation of the moments of a probability distribution from its transform
Numerical computation of the moments of a probability distribution from its transform
1996,
We present a simple, fast, and robust algorithm for numerically computing the first N...
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
1999,
Multistart constructive approaches operate by applying a local search procedure to...
A simple dual algorithm for the generalised assignment problem
A simple dual algorithm for the generalised assignment problem
1996,
A new algorithm for the generalised assignment problem is described in this paper. The...
An object-oriented methodology for solving assignment-type problems with neighborhood search techniques
An object-oriented methodology for solving assignment-type problems with neighborhood search techniques
1996,
Because of its specificity, it is usually difficult to reuse computer code developed...
Dynamic programming approaches to the multiple criteria knapsack problem
Dynamic programming approaches to the multiple criteria knapsack problem
2000,
We study the integer multiple criteria knapsack problem and propose...
A computational study of search strategies for mixed integer programming
A computational study of search strategies for mixed integer programming
1999,
The branch-and-bound procedure for solving mixed integer programming (MIP) problems...
Papers per page: