## Search

Now showing items 1-9 of 9

#### The Convex Hull of Two Core Capacitated Network Design Problems

(Massachusetts Institute of Technology, Operations Research Center, 1990-06)

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated ...

#### Heuristics, LPs, and Trees on Trees: Network Design Analyses

(Massachusetts Institute of Technology, Operations Research Center, 1994-01)

We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...

#### Modeling and Solving the Capacitated Network Loading Problem

(Massachusetts Institute of Technology, Operations Research Center, 1991-01)

This paper studies a topical and economically significant capacitated network design problem that arises in the telecommunications industry. In this problem, given point-topoint demand between various pairs of nodes of a ...

#### The Multi-Network Design Problem

(Massachusetts Institute of Technology, Operations Research Center, 1991-12)

This paper studies a new multi-facility network synthesis problem, called the Multi-level Network Design (MLND) problem, that arises in the topological design of hierarchical communication, transportation, and electric ...

#### Heuristics, LPs, and Generalizations of Trees on Trees

(Massachusetts Institute of Technology, Operations Research Center, 1993-01)

We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...

#### Shortest Paths, Network Design and Associated Polyhedra

(Massachusetts Institute of Technology, Operations Research Center, 1990-04)

We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ...

#### Doubling or Splitting: Strategies for Modeling and Analyzing Survivable Network Design Problems

(Massachusetts Institute of Technology, Operations Research Center, 1994-07)

Survivability is becoming an increasingly important criterion in network design. This paper studies formulations, heuristic worst-case performance, and linear programming relaxations for two classes of survivable network ...

#### Designing Hierarchical Survivable Networks

(Massachusetts Institute of Technology, Operations Research Center, 1994-01)

As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber optic cables, interruptions in service can cause considerable ...

#### A Dual-Based Algorithm for Multi-Level Network Design

(Massachusetts Institute of Technology, Operations Research Center, 1991-12)

Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the ...