Formulations for designing robust networks. An application to wind power collection

DOI10.1016/j.endm.2018.02.011zbMath1392.90021arXiv1806.06704OpenAlexW2793972936MaRDI QIDQ1742258

Marie-Christine Costa, Pierre-Louis Poirion, Cédric Bentz, Thomas Ridremont

Publication date: 11 April 2018

Full work available at URL: https://arxiv.org/abs/1806.06704

zbMATH Keywords

mixed integer programmingbilevel programmingsurvivable networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Cites Work

• On the edge capacitated Steiner tree problem
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Finding the n Most Vital Links in Flow Networks
• Strong formulations for network design problems with connectivity requirements
• Design of Survivable Networks: A survey
• Optimizing the Design of a Wind Farm Collection Network

This page was built for publication: Formulations for designing robust networks. An application to wind power collection