Journal: Annals of Operations Research

Found 3339 papers in total
Models for planning capacity expansion in local access telecommunications networks
Models for planning capacity expansion in local access telecommunications networks
1991,
The rapid progress of communications technology has created new opportunities for...
Dynamic programming based heuristics for the topological design of local access networks
Dynamic programming based heuristics for the topological design of local access networks
1991,
This paper deals with the terminal layout problem, which is a problem arising in data...
Algorithms for recognition of regular properties and decomposition of recursive graph families
Algorithms for recognition of regular properties and decomposition of recursive graph families
1991,
This paper focuses on two themes within the broad context of recursively definable...
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
1991,
Given a graph G , the maximum cut problem consists of finding the subset S of vertices...
Some properties of graph centroids
Some properties of graph centroids
1991,
The concept of a branch weight centroid has been extended in [12] so that it can be...
Finding minimum cost directed trees with demands and capacities
Finding minimum cost directed trees with demands and capacities
1991,
Given a directed graph, the authors consider the problem of finding a rooted directed...
On Steiner ratio conjectures
On Steiner ratio conjectures
1991,
Let M be a metric space and P a finite set of points in M. The Steiner ratio in M is...
Multiterminal xcut problems
Multiterminal xcut problems
1991,
An xcut of a set is defined to be a partition of V into two disjoint nonempty subsets...
The multi-weighted Steiner tree problem
The multi-weighted Steiner tree problem
1991,
The authors formulate and investigate the Multi-Weighted Steiner Problem (MWS), a...
An approach for the Steiner problem in directed graphs
An approach for the Steiner problem in directed graphs
1991,
The authors present a scheme to solve the Steiner problem in directed graphs using a...
A variational approach to the Steiner network problem
A variational approach to the Steiner network problem
1991,
Suppose n points are given in the plane. Their coordinates form a 2n -vector X . To...
The Steiner ratio for five points
The Steiner ratio for five points
1991,
It was conjectured by Gilbert and Pollak that for any finite set of points in the...
Minimal length tree networks on the unit sphere
Minimal length tree networks on the unit sphere
1991,
This paper considers the problem of finding minimal length tree networks on the unit...
The role of Steiner hulls in the solution to Steiner tree problems
The role of Steiner hulls in the solution to Steiner tree problems
1991,
A Steiner tree problem on the plane is that of finding a minimum length Steiner tree...
A simple proof of Hwang’s theorem for rectilinear Steiner minimal trees
A simple proof of Hwang’s theorem for rectilinear Steiner minimal trees
1991,
The authors present a simple, direct proof of Hwang’s characterization of...
On graphs preserving rectilinear shortest paths in the presence of obstacles
On graphs preserving rectilinear shortest paths in the presence of obstacles
1991,
In physical VLSI design, network design (wiring) is the most time-consuming phase. For...
Steiner minimal trees for three points with one convex polygonal obstacle
Steiner minimal trees for three points with one convex polygonal obstacle
1991,
The problem of constructing Steiner minimal trees in the Euclidean plane in NP-hard....
Efficient implementation of heuristics for the continuous network design problem
Efficient implementation of heuristics for the continuous network design problem
1991,
In this paper, the authors present an efficient implementation of heuristic procedures...
Least-cost network topology design for a new service: An application of tabu search
Least-cost network topology design for a new service: An application of tabu search
1991,
The authors describe an implementation of the tabu search metaheuristic that...
Polynomially solvable special cases of the Steiner problem in planar networks
Polynomially solvable special cases of the Steiner problem in planar networks
1991,
The authors give polynomial-time algorithms for two special cases of the Steiner...
Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
1992,
Nonlinear bilevel programming problems, of which the equilibrium network design...
Computing shortest paths in networks derived from recurrence relations
Computing shortest paths in networks derived from recurrence relations
1991,
Dynamic programming formulations of optimization problems often call for the...
Ancestor tree for arbitrary multi-terminal-cut functions
Ancestor tree for arbitrary multi-terminal-cut functions
1991,
In many applications, a function is defined on the cuts of a network. In the max-flow...
Hierarchical optimization: An introduction
Hierarchical optimization: An introduction
1992,
Decision problems involving multiple agents invariably lead to conflict and gaming. In...
Papers per page: