Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance

DOI10.1007/978-3-319-68953-1_4MaRDI QIDQ1698754zbMATH OpenOpenAlexFDO

Authors Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati

Publication date 16 February 2018

Full work available at URL https://hal.inria.fr/hal-01760645/file/440117_1_En_4_Chapter.pdf

zbMATH Keywords

Hamming distancemultiobjective optimizationshortest path problemInverse problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Analysis of algorithms (68W40)

Recommendations

• A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Some inverse optimization problems under the Hamming distance
• scientific article; zbMATH DE number 6535313
• Inverse Bottleneck Optimization Problems on Networks

Cited in

(1)

• An inverse problem of the weighted shortest path problem

This page was built for publication: Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance

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