Some inverse optimization problems under the Hamming distance

European Journal of Operational Research

Volumn 170, Issue 3, 2006, Pages 887-899

  Duin, C W ^a   Volgenant, A ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Combinatorial optimization; Inverse optimization; Linear assignment; Minimum spanning tree; Shortest path

Indexed keywords

COMBINATORIAL MATHEMATICS; COSTS; DISTANCE MEASUREMENT; GRAPH THEORY; INVERSE KINEMATICS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS); VECTORS;

COMBINATORIAL OPTIMIZATION; INVERSE OPTIMIZATION; LINEAR ASSIGNMENT; MINIMUM SPANNING TREE; SHORTEST PATH;

OPERATIONS RESEARCH;

EID: 27744569242     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.059     Document Type: Article

References (18)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall Englewood Cliffs, NJ
2. R.K. Ahuja, and J.B. Orlin A faster algorithm for the inverse spanning tree problem Journal of Algorithms 34 2000 177 193
3. R.K. Ahuja, and J.B. Orlin Inverse optimization Operations Research 49 2001 771 783
4. D. Burton, and Ph.L. Toint On an instance of the inverse shortest paths problem Mathematical Programming 53 1992 45 61
5. D. Burton, and Ph.L. Toint On the use of an inverse shortest paths algorithm for recovering linearly correlated costs Mathematical Programming 63 1994 1 22
6. M.C. Cai, X.G. Yang, and J.Z. Zhang The complexity analysis of the inverse center location problem Journal of Global Optimization 15 1999 213 218
7. E.W. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
8. K.U. Drangmeister, S.O. Krumke, M.V. Marathe, H. Noltemeier, and S.S. Ravi Modifying edges of a network to obtain short subgraphs Theoretical Computer Science 203 1998 91 121
9. C.W. Duin, and A. Volgenant Minimum deviation and balanced optimization: A unified approach Operations Research Letters 10 1991 43 48
10. A. Faragó, A. Szentesi, and B. Szviatovski Inverse optimization in high-speed networks Discrete Applied Mathematics 129 2003 83 98
11. Ford, L.R., Fulkerson, D.R., 1962. Flows in Networks, Princeton, NJ.
12. He, Y., Zhang, B., Yao, E., 2001. Weighted inverse minimum spanning tree problems under Hamming distance, Technical report, Zhjiang University, China.
13. D.D. Sleator, and R.E. Tarjan A data structure for dynamic trees Journal of Computer and System Sciences 24 1983 362 391
14. P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin Solving inverse spanning tree problems through network flow techniques Operations Research 47 1999 291 298
15. A. Volgenant, and R. Jonker The symmetric traveling salesman problem and edge exchanges in minimal 1-trees European Journal of Operational Research 12 1983 394 403
16. C. Yang, and J. Zhang Two general methods for inverse optimization problems Applied Mathematics Letters 12 1999 69 72
17. Zhang B., He, Y., 2003. Constrained bottleneck inverse minimum spanning tree problems under Hamming distance. Working paper, Zhejiang University, Hangzhou, P.R. China.
18. J. Zhang, and Y. Lin Computation of the reverse shortest-path problem Journal of Global Optimization 25 2003 243 261