Inverse generalized minimum cost flow problem under the Hamming distances

DOI10.1007/s40305-018-0231-5zbMath1438.90158OpenAlexW2902347848WikidataQ128813071 ScholiaQ128813071MaRDI QIDQ2314066

Mobarakeh Karimi, Ardeshir Dolati, Massoud Aman

Publication date: 19 July 2019

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-018-0231-5

zbMATH Keywords

inverse problemHamming distancebinary searchgeneralized minimum cost flow

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Production models (90B30)

Cites Work

• Unnamed Item
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Calculating some inverse linear programming problems
• Capacity inverse minimum cost flow problem
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse Optimization
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

This page was built for publication: Inverse generalized minimum cost flow problem under the Hamming distances