In the context of inverse optimization, inverse versions of maximum flow and minimum cost flow problems have thoroughly been investigated. In these network flow problems there are two important problem parameters: flow capacities of the arcs and costs incurred by sending a unit flow on these arcs. Capacity changes for maximum flow problems and cost changes for minimum cost flow problems have been studied under several distance measures such as rectilinear, Chebyshev, and Hamming distances. This thesis also deals with inverse network flow problems and their counterparts tension problems under the aforementioned distance measures. The major goals are to enrich the inverse optimization theory by introducing new inverse network problems that ha...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
Typescript (photocopy).Successful applications of generalized flow programming have been reported in...
Given a directed graph G = (N,A), a tension is a function from A to R which satisfies Kirchhoff\\\'s...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
Given a directed graph G = (N,A) with arc capacities u and a minimum cost flow problem defined on G,...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
Abstract: The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upp...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
Given a network G(V, A, u) with two specific nodes, a source node s and a sink node t, the reverse m...
Given a generalized network and a generalized feasible flow fo, se condider a problem finding a modi...
In this paper, we study the inverse maximum flow problem under \(\ell_\infty\)-norm and show that th...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
Typescript (photocopy).Successful applications of generalized flow programming have been reported in...
Given a directed graph G = (N,A), a tension is a function from A to R which satisfies Kirchhoff\\\'s...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
Given a directed graph G = (N,A) with arc capacities u and a minimum cost flow problem defined on G,...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
Abstract: The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upp...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
Given a network G(V, A, u) with two specific nodes, a source node s and a sink node t, the reverse m...
Given a generalized network and a generalized feasible flow fo, se condider a problem finding a modi...
In this paper, we study the inverse maximum flow problem under \(\ell_\infty\)-norm and show that th...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
Typescript (photocopy).Successful applications of generalized flow programming have been reported in...