Ivana LJUBIC

Ivana LJUBIC

Professor of Operations Research at the ESSEC Business School

The Rooted Maximum Node-Weight Connected Subgraph Problem

Published in CPAIOR, Volume 7874 of Lecture Notes in Computer Science, pp. 300-315, 2013

More details about the conference can be found here

Download paper here

Bibtex:

@inproceedings{DBLP:conf/cpaior/Alvarez-MirandaLM13,
  author    = {Eduardo {\'{A}}lvarez{-}Miranda and
               Ivana Ljubic and
               Petra Mutzel},
  editor    = {Carla P. Gomes and
               Meinolf Sellmann},
  title     = {The Rooted Maximum Node-Weight Connected Subgraph Problem},
  booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
               for Combinatorial Optimization Problems, 10th International Conference,
               {CPAIOR} 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7874},
  pages     = {300--315},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38171-3\_20},
  doi       = {10.1007/978-3-642-38171-3\_20},
  timestamp = {Wed, 25 Sep 2019 18:23:06 +0200},
  biburl    = {https://dblp.org/rec/conf/cpaior/Alvarez-MirandaLM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}