Note on inverse problem with \(l_\infty\) objective function
From MaRDI portal
Publication:1272735
DOI10.1007/s11766-998-0028-0zbMath0913.68100OpenAlexW2319495289MaRDI QIDQ1272735
Publication date: 23 March 1999
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-998-0028-0
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse polymatroidal flow problem
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- An inverse problem of the weighted shortest path problem
- Calculating some inverse linear programming problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Inverse maximum flow and minimum cut problems
- An algorithm for inverse minimum spanning tree problem
- A column generation method for inverse shortest path problems
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Note on inverse problem with \(l_\infty\) objective function