Some inverse optimization problems on network
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5823945 (Why is no real title available?)
- scientific article; zbMATH DE number 1086909 (Why is no real title available?)
- scientific article; zbMATH DE number 939004 (Why is no real title available?)
- A Parametric Method for Solving the Linear Fractional Programming Problem
- A column generation method for inverse shortest path problems
- A further study on inverse linear programming problems
- An inverse problem of the weighted shortest path problem
- Fractional programming
- Graph theory with applications
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow and minimum cut problems
- Inverse problem of minimum cuts
- Linear fractional programming and duality
- Linear programming. Foundations and extensions
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Some inverse optimization problems under the Hamming distance
- The fractional minimal cost flow problem on network
Cited in
(4)
This page was built for publication: Some inverse optimization problems on network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394471)