Weighted inverse maximum perfect matching problems under the Hamming distance
type: Item
instance of: scholarly article
title: Weighted inverse maximum perfect matching problems under the Hamming distance
zbMATH Open document ID: 1268.90116
author: Longcheng Liu
author: Enyu Yao
published in: Journal of Global Optimization
publication date: 2013-04-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6151472
zbMATH Keywords: maximum perfect matching
zbMATH Keywords: inverse problem
zbMATH Keywords: Hamming distance
zbMATH Keywords: NP-hard
zbMATH Keywords: strongly polynomial algorithm
MaRDI profile type: Publication
full work available at URL: s10898-012-9901-8
OpenAlex ID: W2170477096
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Q3059325
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Weighted inverse minimum spanning tree problems under Hamming distance
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Q3048571
cites work: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
cites work: Constrained inverse min-max spanning tree problems under the weighted Hamming distance
cites work: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
cites work: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
cites work: Inverse maximum flow problems under the weighted Hamming distance
cites work: On inverse problems of optimum perfect matching
cites work: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
cites work: The center location improvement problem under the Hamming distance
cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
DOI: 10.1007/S10898-012-9901-8
description: scientific article; zbMATH DE number 6151472