Inverse matroid optimization problem under the weighted Hamming distances

MaRDI QIDQ4604989zbMATH OpenFDO

Authors Massoud Aman, Javad Tayyebi, Hassan Hassanpour

Publication date 6 March 2018

zbMATH Keywords

combinatorial optimizationHamming distanceinverse problemsmatroids

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Some inverse optimization problems under the Hamming distance
• Inverse matroid intersection problem
• scientific article; zbMATH DE number 6535313
• The base-matroid and inverse combinatorial optimization problems.
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE

Cited in

(7)

• Inverse matroid intersection problem
• The base-matroid and inverse combinatorial optimization problems.
• Inverse maximum flow problems under the weighted Hamming distance
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• scientific article; zbMATH DE number 6535313 (Why is no real title available?)
• Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and _-norm objectives

This page was built for publication: Inverse matroid optimization problem under the weighted Hamming distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604989)