Interdicting the activities of a linear program -- a parametric analysis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1019647
- A theoretical analysis on the perturbation to a parameter linear programming
- A parametric method of linearization in mathematical programming problems
- The interval task of linear programming
- Linear programming with estimatable parameters
- scientific article; zbMATH DE number 1322750
- scientific article; zbMATH DE number 2040956
- scientific article; zbMATH DE number 1396591
- Some perturbation theory for linear programming
Cites work
- scientific article; zbMATH DE number 3179971 (Why is no real title available?)
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A problem in network interdiction
- Characterization of all optimal solutions and parametric maximal mows in networks
- Finding the most vital arcs in a network
- Maximizing the minimum source-sink path subject to a budget constraint
- Most vital links and nodes in weighted networks
- Network flows. Theory, algorithms, and applications.
- Optimal interdiction of a supply network
- The k most vital arcs in the shortest path problem
Cited in
(2)
This page was built for publication: Interdicting the activities of a linear program -- a parametric analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390246)