Branch and bound approach for marking optimization problem of weighted marked graphs

Leila Toursi, Nathalie Sauer. Branch and bound approach for marking optimization problem of weighted marked graphs. In Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004. pages 1777-1782, IEEE, 2004. [doi]

@inproceedings{ToursiS04,
  title = {Branch and bound approach for marking optimization problem of weighted marked graphs},
  author = {Leila Toursi and Nathalie Sauer},
  year = {2004},
  doi = {10.1109/ICSMC.2004.1399900},
  url = {http://dx.doi.org/10.1109/ICSMC.2004.1399900},
  tags = {optimization, graph-rewriting, rewriting, systematic-approach},
  researchr = {https://researchr.org/publication/ToursiS04},
  cites = {0},
  citedby = {0},
  pages = {1777-1782},
  booktitle = {Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004},
  publisher = {IEEE},
  isbn = {0-7803-8566-7},
}