A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE

DOI10.1142/S0217595907001474zbMath1159.90319MaRDI QIDQ3503010

Enyu Yao, Longcheng Liu

Publication date: 20 May 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (6)

Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ Inverse min-max spanning tree 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 ⋮ 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

Cites Work

• 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
• Some inverse optimization problems under the Hamming distance
• Inverse maximum flow and minimum cut problems

This page was built for publication: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE