Capacity inverse minimum cost flow problem

Journal of Combinatorial Optimization

Volumn 19, Issue 1, 2010, Pages 43-59

  Güler, Çiǧdem ^a   Hamacher, Horst W ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

Inverse problems; Minimum cost flows; Network flows

Indexed keywords

BICRITERIA PROBLEMS; CHEBYSHEV; COMPUTATIONAL RESULTS; DIRECTED GRAPHS; DISTANCE MEASURE; GREEDY ALGORITHMS; MINIMUM COST FLOW PROBLEM; MINIMUM COST FLOWS; NETWORK FLOWS; NP-HARD; OPTIMAL SOLUTIONS; SET PROBLEMS;

CAVITY RESONATORS; COMPUTATIONAL COMPLEXITY; COST ACCOUNTING; DIFFERENTIAL EQUATIONS; HEURISTIC METHODS; INVERSE PROBLEMS;

COSTS;

EID: 74249115879     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9159-8     Document Type: Article

References (22)

1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, New York
2. RK Ahuja JB Orlin 2001 Inverse optimization Oper Res 49 771 783 1163.90764 10.1287/opre.49.5.771.10607 1860425
3. RK Ahuja JB Orlin 2002 Combinatorial algorithms of inverse network flow problems Networks 40 181 187 1026.90089 10.1002/net.10048 1938783 (Pubitemid 37218329)
4. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin
5. RE Burkard HW Hamacher 1981 Minimal cost flows in regular matroids Math Program Stud 14 32 47 0449.90095 600120
6. D Burton PL Toint 1992 On an instance of the inverse shortest paths problem Math Program 53 45 61 0756.90089 10.1007/BF01585693 1151764
7. D Burton PL Toint 1994 On the use of an inverse shortest paths algorithm for recovering linearly correlated costs Math Program 63 1 22 10.1007/BF01582056 1257989
8. A Caprara M Fischetti P Toth 2000 Algorithms for the set covering problem Ann Oper Res 89 353 371 10.1023/A:1019225027893 1839889 (Pubitemid 33282741)
9. C Demetrescu I Finocchi 2003 Combinatorial algorithms for feedback problems in directed graphs Inf Process Lett 86 129 136 1173.68586 10.1016/S0020-0190(02)00491-X 1970105
10. Garey MR, Johnson DS (1979) Computers and intractability: a guide to theory of NP-completeness. Freeman, New York
11. D Goldfarb MD Grigoriadis 1988 A computational comparison of the dinic and network simplex methods for maximum flow Ann Oper Res 13 83 123 10.1007/BF02288321 950990
12. HW Hamacher K-H Küfer 2002 Inverse radiation therapy planning-a multiple objective optimization approach Discrete Appl Math 118 145 161 0995.92024 10.1016/S0166-218X(01)00261-X 1888554 (Pubitemid 34185780)
13. C Heuberger 2004 Inverse optimization: a survey on problems, methods, and results J Comb Optim 8 329 361 1084.90035 10.1023/B:JOCO.0000038914.26975.9b 2092264
14. Kann V (1992) On the approximability of NP-complete optimization problems. PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Sweden
15. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations, pp 85-103
16. D Klingman A Napier J Stutz 1974 NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems Manage Sci 20 814 820 0303.90042 10.1287/mnsc.20.5.814 329614
17. Y Saab 2001 A fast and effective algorithm for the feedback arc set problem J Heuristics 7 235 250 0972.68633 10.1023/A:1011315014322 (Pubitemid 32517557)
18. Siek JG, Lee L-Q, Lumsdaine A (2002) The boost graph library: user guide and reference manual. Addison-Wesley, Reading
19. C Yang J Zhang Z Ma 1997 Inverse maximum flow and minimum cut problems Optimization 40 147 170 0880.90041 10.1080/02331939708844306 1620376
20. J Zhang L Liu 2006 Inverse maximum flow problems under the weighted hamming distance J Comb Optim 12 395 408 1126.90070 10.1007/s10878-006-9000-1 2265911 (Pubitemid 44546694)
21. J Zhang Z Liu 1996 Calculating some inverse linear programming problems J Comput Appl Math 72 261 273 0856.65069 10.1016/0377-0427(95)00277-4 1406213 (Pubitemid 126380098)
22. ∞ norm J Comb Optim 6 207 227 1032.90030 10.1023/A:1013807829021 1885492 (Pubitemid 34176304)