Capacity inverse minimum cost flow problem
From MaRDI portal
Recommendations
- Inverse minimum flow problem
- Flow constrained minimum cost flow problem
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Minimum cost flow problem
- Inverse maximum flow and minimum cut problems
- Inverse feasibility problems of the inverse maximum flow problems
- Minimum-cost flows in unit-capacity networks
- The inverse maximum dynamic flow problem
- An inverse maximum capacity path problem with lower bound constraints
- scientific article; zbMATH DE number 3918062
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- A fast and effective algorithm for the feedback arc set problem
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Algorithms for the set covering problem
- Calculating some inverse linear programming problems
- Combinatorial algorithms for feedback problems in directed graphs
- Combinatorial algorithms for inverse network flow problems
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow and minimum cut problems
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Minimal cost flows in regular matroids
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- The shortest path improvement problems under Hamming distance
Cited in
(15)- An inverse maximum capacity path problem with lower bound constraints
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- Inferring linear feasible regions using inverse optimization
- Inverse optimization for the recovery of constraint parameters
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- scientific article; zbMATH DE number 1484312 (Why is no real title available?)
- The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Minimum cost flow in a network with an underestimated arc capacity
- Inverse generalized minimum cost flow problem under the Hamming distances
- Solving the undirected minimum cost flow problem with arbitrary costs
This page was built for publication: Capacity inverse minimum cost flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268762)
