Constrained inverse minimum flow problems under the weighted Hamming distance
From MaRDI portal
Publication:2049978
DOI10.1016/j.tcs.2021.06.006OpenAlexW3168630492MaRDI QIDQ2049978
Publication date: 27 August 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.006
inverse optimization problemsweighted Hamming distancestrongly polynomial algorithmsminimum flow problem
Cites Work
- Unnamed Item
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse minimum flow problem
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- On an instance of the inverse shortest paths problem
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance
- Weighted inverse minimum spanning tree problems under Hamming distance
- The center location improvement problem under the Hamming distance
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Weighted inverse maximum perfect matching problems under the Hamming distance
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Some inverse optimization problems under the Hamming distance
- The inverse maximum flow problem consideringl∞norm
This page was built for publication: Constrained inverse minimum flow problems under the weighted Hamming distance
