Add to ORKGWhen a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destruction is known to be $NP$-hard for $k=2$. We show that when a flow is allowed to be adaptive the problem becomes polynomial for every fixed $k$
In this paper, we will extend the results about the parametric maximum flow problem to networks in w...
International audienceNetwork flow formulations are among the most successful tools to solve optimiz...
AbstractThis paper considers a new class of network flows, called dynamic generative network flows i...
AbstractWe introduce networks with additive losses and gains on the arcs. If a positive flow of x un...
This paper is concerned with a sensitivity analysis on a maximum flow network. The network is define...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed ...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
We introduce and investigate reroutable flows, a robust version of network flows in which link failu...
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negati...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
AbstractMost primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancellin...
Summary. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimiz...
This thesis examines several problems related to singly-constrained Monotropic Network Flow Problems...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
In this paper, we will extend the results about the parametric maximum flow problem to networks in w...
International audienceNetwork flow formulations are among the most successful tools to solve optimiz...
AbstractThis paper considers a new class of network flows, called dynamic generative network flows i...
AbstractWe introduce networks with additive losses and gains on the arcs. If a positive flow of x un...
This paper is concerned with a sensitivity analysis on a maximum flow network. The network is define...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed ...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
We introduce and investigate reroutable flows, a robust version of network flows in which link failu...
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negati...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
AbstractMost primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancellin...
Summary. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimiz...
This thesis examines several problems related to singly-constrained Monotropic Network Flow Problems...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
In this paper, we will extend the results about the parametric maximum flow problem to networks in w...
International audienceNetwork flow formulations are among the most successful tools to solve optimiz...
AbstractThis paper considers a new class of network flows, called dynamic generative network flows i...