A general model of some inverse combinatorial optimization problems and its solution method under l∞ norm

Journal of Combinatorial Optimization

Volumn 6, Issue 2, 2002, Pages 207-227

  Zhang, Jianzhong ^a   Liu, Zhenhong ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Assignment; Basis; Cycle; Matching; Matroid intersection; Mean cycle; Path; Spanning tree

Indexed keywords

ALGORITHMS; INVERSE PROBLEMS; MATRIX ALGEBRA; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION; INVERSE OPTIMIZATION PROBLEM; MATROID INTERSECTION; NEWTON-TYPE ALGORITHM; OPTIMIZATION MODEL; POLYNOMIAL TIME; SPANNING TREE;

MATHEMATICAL MODELS;

EID: 0036604787     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013807829021     Document Type: Article

References (26)

1. On an instance of the inverse shortest paths problem
2. An inverse problem of the weighted shortest path problem
3. A column generation method for inverse shortest path problem
4. Calculating some inverse linear programming problem
5. On inverse problem of minimum spanning tree with partition constraints
6. A network flow method for solving some inverse combinatorial optimization problems
7. Inverse maximum flow and minimum cut problems
8. An algorithm for inverse minimum spanning tree problem
9. Inverse maximum capacity problem
10. A strongly polynomial algorithm for the inverse arborescence problem
11. Two general methods for inverse optimization problems
12. Inverse fractional matching problem
13. Inverse maximum perfect matching
14. A further study on inverse linear programming
15. Some reverse location problem
16. A constrained capacity expansion problem on network
17. A class of bottleneck expansion problem
18. Combinatorial optimization with rational objective functions
19. Applying parallel computation algorithms in the design of serial algorithms
20. Parametric flow weighted means of cuts, and fractional combinatorial optimization
21. A weighted matroid intersection algorithm
22. Matroid intersection
23. Constrained matroidal bottleneck problem
24. An oracle-strongly polynomial algorithm for bottleneck expansion problems
25. A characterization of the minimum mean cycle in digraph