Inverse maximum flow problems under the weighted Hamming distance

DOI10.1007/S10878-006-9006-8zbMATH Open1126.90070OpenAlexW2018562299MaRDI QIDQ2385473FDOQ2385473

Authors: Longcheng Liu, Jianzhong Zhang 

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

Recommendations

• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
• Constrained inverse minimum flow problems under the weighted Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse minimum flow problem under the weighted sum-type Hamming distance
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• Inverse generalized minimum cost flow problem under the Hamming distances
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse matroid optimization problem under the weighted Hamming distances
• Weighted inverse maximum perfect matching problems under the Hamming distance
• scientific article; zbMATH DE number 6535313

zbMATH Keywords

Hamming distanceInverse problemsMaximum flowStrongly polynomial algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow and minimum cut problems
• Weighted inverse minimum spanning tree problems under Hamming distance
• The center location improvement problem under the Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Some inverse optimization problems under the Hamming distance
• Computing and Combinatorics

Cited In (24)

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

This page was built for publication: Inverse maximum 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 Q2385473)