Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance

DOI10.1142/S1793557116500686zbMath1346.90711OpenAlexW2286251202MaRDI QIDQ2818313

Fahimeh Baroughi Bonab, M. R. Mohaghegh

Publication date: 7 September 2016

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557116500686

zbMATH Keywords

combinatorial optimizationHamming distanceinverse optimization problemcomplexity theorymin-max spanning \(r\)-arborescence

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Inverse optimization problems with multiple weight functions

Cites Work

• Unnamed Item
• Inverse median location problems with variable coordinates
• Inverse conic programming with applications
• Inverse median problems
• Inverse Optimization
• Efficient Algorithms for the Inverse Spanning-Tree Problem

This page was built for publication: Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance