Inverse minimum cost flow problems under the weighted Hamming distance
DOI10.1016/J.EJOR.2010.03.029zbMATH Open1205.90062OpenAlexW2016702464MaRDI QIDQ992575FDOQ992575
Authors: Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.029
Recommendations
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- Inverse generalized minimum cost flow problem under the Hamming distances
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance
- Constrained inverse minimum flow problems under the weighted Hamming distance
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow problems under the weighted Hamming distance
- Inverse Optimization
- Weighted inverse minimum spanning tree problems under Hamming distance
- The center location improvement problem under the Hamming distance
- Calculating some inverse linear programming problems
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
Cited In (17)
- A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
- Title not available (Why is that?)
- 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
- Inverse Bottleneck Optimization Problems on Networks
- Capacity inverse minimum cost flow problems under the weighted Hamming distance
- A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance
- Inverse maximum flow problems under the weighted Hamming distance
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Constrained inverse minimum flow problems under the weighted Hamming distance
- Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- The inverse parallel machine scheduling problem with minimum total completion time
- Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
- Inverse generalized minimum cost flow problem under the Hamming distances
- Weighted inverse maximum perfect matching problems under the Hamming distance
This page was built for publication: Inverse minimum cost flow problems under the weighted Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992575)
