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

DOI10.1016/J.COR.2017.05.015MaRDI QIDQ102056WikidataFDO

Authors Markus Sinnl, Eduardo Álvarez-Miranda

Publication date November 2017

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

Full work available at URL https://doi.org/10.1016/J.COR.2017.05.015

Cited in

(1)

• mwcsr

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q102056)