A branch-and-cut approach for minimum cost multi-level network design

13 years 4 months ago

Download www.kellogg.northwestern.edu

Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on

Sunil Chopra, Chih-Yang Tsai

Real-time Traffic

DM 2002 | Dual Ascent Approach | Network Design | Network Design Models |

claim paper

» Fast Analytic Placement using Minimum Cost Flow

» Designing DemandWise Shared Protection Networks with Specified Minimum DualFailure Restora...

» Minimizing communication cost in a distributed Bayesian network using a decentralized MDP

» A Memetic Algorithm for the Generalized Minimum VertexBiconnected Network Problem

» New Approaches for Virtual Private Network Design

» Efficient PowerAware Network Provisioning for AllOptical Multicasting in WDM Mesh Networks

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» Optimal network topology design in multiagent systems for efficient average consensus

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Sunil Chopra, Chih-Yang Tsai

Comments (0)

Sciweavers

A branch-and-cut approach for minimum cost multi-level network design

DM 2002 | Dual Ascent Approach | Network Design | Network Design Models |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers