A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems

DOI10.1016/j.cor.2017.05.015WikidataQ126130209 ScholiaQ126130209MaRDI QIDQ102056

Markus Sinnl, Eduardo Álvarez-Miranda

Publication date: November 2017

Published in: Computers & Operations Research (Search for Journal in Brave)

Related Items (1)

mwcsr

This page was built for publication: A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems