Strong formulations and cutting planes for designing digital data service networks

Youngho Lee, Lu Lu, Yuping Qiu, Fred Glover

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

This paper deals with the problem of designing a least-cost digital data service (DDS) network that connects a given set of locations through digital switching offices with bridging capabilities. We present several alternative mixed 0-1 integer programming formulations and evaluate analytically their relative strengths by comparing their respective linear programming relaxations. By exploiting the structures inherent in a particularly strong formulation, we develop several classes of valid inequalities and cutting planes in order to tighten the initial formulation. For several problems of real-world data, computational results show that the strong formulation with valid inequalities and cutting planes generates a very tight lower bound (over 98% of the optimality) and so finds an optimal solution well within an acceptable time bound.

Original languageEnglish
Pages (from-to)261-274
Number of pages14
JournalTelecommunication Systems
Volume2
Issue number1
DOIs
Publication statusPublished - 1993 Dec 1
Externally publishedYes

Fingerprint

Integer programming
Linear programming
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Strong formulations and cutting planes for designing digital data service networks. / Lee, Youngho; Lu, Lu; Qiu, Yuping; Glover, Fred.

In: Telecommunication Systems, Vol. 2, No. 1, 01.12.1993, p. 261-274.

Research output: Contribution to journalArticle

Lee, Youngho ; Lu, Lu ; Qiu, Yuping ; Glover, Fred. / Strong formulations and cutting planes for designing digital data service networks. In: Telecommunication Systems. 1993 ; Vol. 2, No. 1. pp. 261-274.
@article{165c637f30bb4744893fe3995208b730,
title = "Strong formulations and cutting planes for designing digital data service networks",
abstract = "This paper deals with the problem of designing a least-cost digital data service (DDS) network that connects a given set of locations through digital switching offices with bridging capabilities. We present several alternative mixed 0-1 integer programming formulations and evaluate analytically their relative strengths by comparing their respective linear programming relaxations. By exploiting the structures inherent in a particularly strong formulation, we develop several classes of valid inequalities and cutting planes in order to tighten the initial formulation. For several problems of real-world data, computational results show that the strong formulation with valid inequalities and cutting planes generates a very tight lower bound (over 98{\%} of the optimality) and so finds an optimal solution well within an acceptable time bound.",
author = "Youngho Lee and Lu Lu and Yuping Qiu and Fred Glover",
year = "1993",
month = "12",
day = "1",
doi = "10.1007/BF02109861",
language = "English",
volume = "2",
pages = "261--274",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Strong formulations and cutting planes for designing digital data service networks

AU - Lee, Youngho

AU - Lu, Lu

AU - Qiu, Yuping

AU - Glover, Fred

PY - 1993/12/1

Y1 - 1993/12/1

N2 - This paper deals with the problem of designing a least-cost digital data service (DDS) network that connects a given set of locations through digital switching offices with bridging capabilities. We present several alternative mixed 0-1 integer programming formulations and evaluate analytically their relative strengths by comparing their respective linear programming relaxations. By exploiting the structures inherent in a particularly strong formulation, we develop several classes of valid inequalities and cutting planes in order to tighten the initial formulation. For several problems of real-world data, computational results show that the strong formulation with valid inequalities and cutting planes generates a very tight lower bound (over 98% of the optimality) and so finds an optimal solution well within an acceptable time bound.

AB - This paper deals with the problem of designing a least-cost digital data service (DDS) network that connects a given set of locations through digital switching offices with bridging capabilities. We present several alternative mixed 0-1 integer programming formulations and evaluate analytically their relative strengths by comparing their respective linear programming relaxations. By exploiting the structures inherent in a particularly strong formulation, we develop several classes of valid inequalities and cutting planes in order to tighten the initial formulation. For several problems of real-world data, computational results show that the strong formulation with valid inequalities and cutting planes generates a very tight lower bound (over 98% of the optimality) and so finds an optimal solution well within an acceptable time bound.

UR - http://www.scopus.com/inward/record.url?scp=0000349497&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000349497&partnerID=8YFLogxK

U2 - 10.1007/BF02109861

DO - 10.1007/BF02109861

M3 - Article

AN - SCOPUS:0000349497

VL - 2

SP - 261

EP - 274

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 1

ER -