Weighted inverse maximum perfect matching problems under the Hamming distance

DOI10.1007/s10898-012-9901-8zbMath1268.90116OpenAlexW2170477096MaRDI QIDQ1945512

Longcheng Liu, Enyu Yao

Publication date: 8 April 2013

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

Full work available at URL: https://doi.org/10.1007/s10898-012-9901-8

zbMATH Keywords

inverse problemHamming distanceNP-hardstrongly polynomial algorithmmaximum perfect matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (6)

On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks ⋮ Inverse optimization problems with multiple weight functions

Cites Work

• Unnamed Item
• Unnamed Item
• 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 inverse problems of optimum perfect matching
• Weighted inverse minimum spanning tree problems under Hamming distance
• The center location improvement problem under the Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• TWO THEOREMS IN GRAPH THEORY
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Weighted inverse maximum perfect matching problems under the Hamming distance