Inverse maximum flow problems under the weighted Hamming distance

DOI10.1007/s10878-006-9006-8zbMath1126.90070OpenAlexW2018562299MaRDI QIDQ2385473

Longcheng Liu, Zhang, Jianzhong

Publication date: 12 October 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9006-8

zbMATH Keywords

Hamming distanceInverse problemsMaximum flowStrongly polynomial algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (20)

Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Capacity inverse minimum cost flow problems under the weighted Hamming distance ⋮ The inverse parallel machine scheduling problem with minimum total completion time ⋮ A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE ⋮ The inverse maximum dynamic flow problem ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ Inverse min-max spanning tree problem under the weighted sum-type Hamming distance ⋮ Reverse maximum flow problem under the weighted Chebyshev 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 ⋮ The inverse maximum flow problem consideringl_∞norm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse minimum cost flow problems under the weighted Hamming distance ⋮ Constrained inverse min-max spanning tree problems under the weighted Hamming distance ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance ⋮ Inverse scheduling with maximum lateness objective ⋮ Inverse feasibility problems of the inverse maximum flow problems

Cites Work

• 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
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Some inverse optimization problems under the Hamming distance
• Inverse maximum flow and minimum cut problems
• Computing and Combinatorics

This page was built for publication: Inverse maximum flow problems under the weighted Hamming distance