Take Action

Home | Faculty & Research Overview | Research

Research Details

A Branch-and-Cut Approach for Minimum Cost Multi-level Network Design, Discrete Mathematics

Abstract

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 finding good heuristic solutions. In this study, we develop algorithms that solve the multi-level network design problem to optimality. In our approach, the problem is converted to a Steiner tree problem and is solved by a branch-and-cut approach. Our computational study shows that the approach outperforms a dual ascent approach in the literature (Mirchandani, INFORMS J. Comput. 8 (3) (1996) 202) not only on solution times but also on the quality of the solutions.

Type

Article

Author(s)

Sunil Chopra, Chih-Yang Tsai

Date Published

2002

Citations

Chopra, Sunil, and Chih-Yang Tsai. 2002. A Branch-and-Cut Approach for Minimum Cost Multi-level Network Design. Discrete Mathematics. 242(1): 65-92.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more

Take Action