An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem

  • Published 2018

Abstract

Resum This document describes an alternative integer linear programming (ILP) model for the so-called edge-disjoint paths (EDP) problem in undirected graphs. EDP is an N P-hard problem where exact methods are not able to produce high quality solutions. Therefore, we propose two different algorithms for combining exact and heuristic methods. On the one hand… (More)

Topics

  • Presentations referencing similar topics