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

@inproceedings{Blum2017AnAI, title={An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem}, author={Christian Blum and Maria J. Blesa and Abraham Duarte and Jes{\'u}s S{\'a}nchez-Oro}, year={2017} }

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, we consider a restricted model that limits the number of paths between two given nodes in the graphs (which reduces the search space… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES

## A Matheuristic Approach for Solving the Edge- Disjoint Paths Problem

VIEW 1 EXCERPT

## Reducibility Among Combinatorial Problems

VIEW 1 EXCERPT