iagoac/mbct-exact

Exact methods for solving the The Minimum-Cost Bounded-Error Calibration Tree problem

Source code of the paper An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem

In this repository, one can find the implementations of the Augmented $\epsilon$-constraints method used in the above-mentioned paper, along with the instances and the obtained results. The paper is available at https://link.springer.com/article/10.1007%2Fs10479-019-03443-4.

The instances and the results are also available at Mendeley.

If you are using these codes in your paper, please cite the original paper publisehd in Annals of Operations Research:

@article{Carvalho2020,
title={An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem},
author={Carvalho, Iago A and Ribeiro, Marco A},
journal={Annals of Operations Research},
volume={287},
number={1},
pages={109--126},
year={2020},
publisher={Springer},
doi={10.1007/s10479-019-03443-4}
}

Furthermore, if you are using the dataset, please cite the Mendeley repository:

@Misc{Carvalho2019,
title={Data for "An exact approach for the minimum-cost bounded-error calibration tree problem"},
author={Carvalho, Iago A.},
howPublished={\url{https://doi.org/10.17632/3kb6hwbz8r.2}},
year={2020},
doi={https://doi.org/10.17632/3kb6hwbz8r.2},
note={Mendeley Data, v. 2.0}
}