Optimization Online


Integer Network Synthesis Problem for Hop Constrained Flows

Santosh Kabadi(kabadi***at***unb.ca)
K. P. K. Nair(nairk***at***unb.ca)

Abstract: Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of flow requirements are sufficiently large.

Keywords: Network Synthesis, Hop Constraints, Telecommunications

Category 1: Network Optimization

Category 2: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 10/12/2009
Entry Accepted: 10/13/2009
Entry Last Modified: 10/12/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society