Synthesis of 2-commodity flow networks

Refael Hassin, Asaf Levin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate network planning and design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible solutions and using this characterization we reduce the size of the LP program. For the case that all non-zero requirements are equal we present a closed fractional optimal solution, a closed integer (where the capacities of the solution network are integer) optimal solution and we investigate the integral case for which an integer 2-commodity flow must exist for every pair of requirements.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings
EditorsKaren Aardal, Bert Gerards
PublisherSpringer Verlag
Pages226-235
Number of pages10
ISBN (Print)3540422250, 9783540422259
DOIs
StatePublished - 2001
Event8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands
Duration: 13 Jun 200115 Jun 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2081
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
Country/TerritoryNetherlands
CityUtrecht
Period13/06/0115/06/01

Fingerprint

Dive into the research topics of 'Synthesis of 2-commodity flow networks'. Together they form a unique fingerprint.

Cite this