R. K. Ahuja and J. B. Orlin, Inverse optimization, Operation Research 49, pp.771-783, 2001.

D. Burton and P. L. Toint, On an instance of the inverse shortest paths problem, Mathematical Programming, vol.89, issue.B7, pp.45-61, 1992.
DOI : 10.1007/BF01585693

C. W. Duin and A. Volgenant, Some inverse optimization problems under the Hamming distance, European Journal of Operational Research, vol.170, issue.3, pp.887-899, 2006.
DOI : 10.1016/j.ejor.2004.07.059

M. Ehrgott, Multicriteria optimization, 2005.
DOI : 10.1007/978-3-662-22199-0

A. Farago, A. Szentesi, and B. Szviatovszki, Inverse optimization in high-speed networks, Discrete Applied Mathematics, vol.129, issue.1, pp.83-98, 2003.
DOI : 10.1016/S0166-218X(02)00235-4

J. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401
DOI : 10.1002/j.1538-7305.1957.tb01515.x

J. Roland, Y. D. Smet, and J. R. Figueira, Inverse multi-objective combinatorial optimization, Discrete Applied Mathematics, vol.161, issue.16-17, pp.2764-2771, 2013.
DOI : 10.1016/j.dam.2013.04.024

URL : https://dipot.ulb.ac.be/dspace/bitstream/2013/209383/1/0deca936-30a0-40b9-b90a-5bb5c6f690cd.txt

P. Serafini, Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems, Lecture Notes in Economics and Mathematical Systems, vol.294, pp.222-232, 1986.
DOI : 10.1007/978-3-642-46618-2_15

J. Tayyebi and M. Aman, On inverse linear programming problems under the bottleneck-type weighted Hamming distance, Discrete Applied Mathematics, vol.240, 2015.
DOI : 10.1016/j.dam.2015.12.017

D. C. Wei, An Optimized Floyd Algorithm for the Shortest Path Problem, Journal of Networks, vol.5, issue.12, pp.1496-1504, 2010.
DOI : 10.4304/jnw.5.12.1496-1504

S. Xu and J. Zhang, An inverse problem of the weighted shortest path problem, Japan Journal of Industrial and Applied Mathematics, vol.16, issue.1, pp.47-59, 1995.
DOI : 10.1515/9781400873173

J. Z. Zhang, Z. Ma, and C. Yang, A column generation method for inverse shortest path problems, Zeitschrift fr Operations Research 41, pp.347-358, 1995.
DOI : 10.1007/bf01432364

J. Z. Zhang and Z. Ma, A network flow method for solving some inverse combinatorial optimization problems, Optimization, vol.37, issue.1, pp.59-72, 1996.
DOI : 10.1007/BF01432364