A Network Design Problem with Two-Edge Matching Failures.

Firdovsi Sharifov Hakan Kutucu

Published in: RAIRO Oper. Res. (2015)

Keyphrases

network design problem
benders decomposition
network design
approximation algorithms
branch and bound
minimal cost
transportation networks
lagrangian relaxation
integer programming
mixed integer
mixed integer programming
valid inequalities
np hard
linear programming
graph cuts