scispace - formally typeset
Journal ArticleDOI

Facility location models for planning a transatlantic communications network

G.A. Kochman, +1 more
- 01 Feb 1981 - 
- Vol. 6, Iss: 2, pp 205-211
Reads0
Chats0
TLDR
This paper presents two facility location models for the problem of determining how to optimally serve the requirements for communication circuits between the United States and various European and Middle Eastern countries.
About
This article is published in European Journal of Operational Research.The article was published on 1981-02-01. It has received 22 citations till now. The article focuses on the topics: Facility location problem & Network planning and design.

read more

Citations
More filters
Journal ArticleDOI

Operations Research and Capacity Expansion Problems: A Survey

Hanan Luss
- 01 Oct 1982 - 
TL;DR: This paper attempts to unify the existing literature on capacity expansion problems, emphasizing modeling approaches, algorithmic solutions, and relevant applications, and includes an extensive list of references.
Journal ArticleDOI

A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs

TL;DR: This paper presents a mixed integer nonlinear programming model for the design of a dynamic integrated distribution network to account for the integrated aspect of optimizing the forward and return network simultaneously.
Journal ArticleDOI

Facility location models for distribution planning

TL;DR: This paper reviews some of the significant contributions which have been made to the relevant and current state of knowledge on where to best site warehouses in the warehouse industry.
Journal ArticleDOI

A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem.

TL;DR: In this article, a comparison of approaches proposed in the literature for the Capacitated plant location problem is presented, based on new theoretical and computational results, and the main emphasis is on relaxations.
Journal ArticleDOI

An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes

TL;DR: An optimization algorithm for solving the Dynamic Capacitated Plant Location Problem DCPLP based on the Lagrangian relaxation technique is described and results indicate that the algorithm produces solutions within 3% of the lower bounds for a wide range of input data.
References
More filters
Journal ArticleDOI

Minimum cost routing for dynamic network models

Bernard Yaged
- 01 Jan 1971 - 
TL;DR: Techniques which can be applied to long range planning studies for the domestic long haul communications network, of deciding how to route future demands and install transmission facilities so as to minimize the present worth of expenditures during the study interval are developed.
Journal ArticleDOI

A primal algorithm for solving a capacitated network flow problem with additional linear constraints

TL;DR: A variant of the revised simplex method is given for solving capacitated network flow problems with additional linear constraints for pivoting, pricing, and inversion that can result in a substantial reduction of computation over a standard linear programming approach.
Journal ArticleDOI

On building minimum cost communication networks over time

Norman Zadeh
- 01 Jan 1974 - 
TL;DR: It is observed that for a large subclass of practical problems, the dynamic problem of building a network over time may be converted to a static problem for most of the computations, which suggests a strong similarity between the optimal solutions to both problems.
Journal ArticleDOI

Optimal Network Capacity Planning: A Shortest-Path Scheme

TL;DR: The sequential decision problem considered in this paper consists of finding an optimal policy for increasing the capacity of a multi-terminal network with requirements increasing over a planning period and arcs subject to failure.
Journal ArticleDOI

Deferral strategies for a dynamic communications network

TL;DR: This paper deals with the problem of minimizing the present worth of expenditures for the expanding the capacity of a communications network in the face of an increasing demand for service and proposes a strategy that defers new construction of facilities by heuristic routing around exhausted facilities.
Related Papers (5)