Capacity inverse minimum cost flow problem
From MaRDI portal
Publication:2268762
DOI10.1007/s10878-008-9159-8zbMath1185.90025OpenAlexW1972844915MaRDI QIDQ2268762
Horst W. Hamacher, çiğdem Güler
Publication date: 9 March 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-15097
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items
Capacity inverse minimum cost flow problems under the weighted Hamming distance ⋮ Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Inferring linear feasible regions using inverse optimization ⋮ Inverse optimization for the recovery of constraint parameters ⋮ Inverse generalized minimum cost flow problem under the Hamming distances ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial algorithms for feedback problems in directed graphs
- On an instance of the inverse shortest paths problem
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse radiation therapy planning -- a multiple objective optimization approach
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- The shortest path improvement problems under Hamming distance
- Inverse Optimization
- Minimal cost flows in regular matroids
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Inverse maximum flow and minimum cut problems
- Combinatorial algorithms for inverse network flow problems
- Algorithms for the set covering problem
- A fast and effective algorithm for the feedback arc set problem
