Inverse optimization in minimum cost flow problems on countably infinite networks

Given the costs and a feasible solution for a minimum cost flow problem on a countably infinite network, inverse optimization involves finding new costs that are close to the original ones and that make the given solution optimal. We study this problem using the weighted absolute sum metric to quant...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2019-04, Vol.73 (3), p.292-305
Hauptverfasser:	Nourollahi, Sevnaz, Ghate, Archis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Cost engineering countably infinite linear programs duality infinite-dimensional optimization Minimum cost Optimization Polynomials Shortest-path problems Simplex method
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!