abstract="In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem -- a special dominating set problem for sensor placement in power systems -- and its connected version. We propose formulations and algorithms to solve these integer programs, and report results for several power system graphs.",
isbn="978-3-642-31770-5"
}
@article{mtz_orig,
author={Miller, C. E. and Tucker, A. W. and Zemlin, R. A.},
title={Integer Programming Formulation of Traveling Salesman Problems},
year={1960},
issue_date={Oct. 1960},
publisher={Association for Computing Machinery},
address={New York, NY, USA},
volume={7},
number={4},
issn={0004-5411},
url={https://doi.org/10.1145/321043.321046},
doi={10.1145/321043.321046},
journal={J. ACM},
month=oct,
pages={326–329},
numpages={4}
}
@article{mtz_improv,
author={Desrochers, Martin and Laporte, Gilbert},
title={Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints},