YoVDO

Design of Survivable Networks with Bounded-Length Paths

Offered By: GERAD Research Center via YouTube

Tags

Network Design Courses Graph Theory Courses Integer Programming Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the design of survivable networks with bounded-length paths in this 52-minute seminar from GERAD Research Center. Delve into the k-edge-disjoint L-hop-connected paths problem, which aims to find a minimum cost subgraph with at least k edge-disjoint paths of length at most L between terminal pairs. Examine integer programming formulations, valid inequalities, and separation routines for this problem, which has applications in telecommunication network design. Learn about a Branch-and-Cut algorithm for specific cases where L=2,3 and k=2. Discover the integrality of the linear relaxation of the associated polytope when L=3, k≥2, and |K|=1, leading to a polynomial time cutting plane algorithm for this scenario.

Syllabus

Design of Survivable Networks with Bounded-Length Paths, A. Ridha Mahjoub


Taught by

GERAD Research Center

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer