DOIAbstract
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The result has application to integer multiflow optimization
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The result has application to integer multiflow optimization
Summary. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimiz...
Abstract: The theory and applications of network flows is probabily the most important single tool f...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
The original motivation for investigating the Linear Balancing Flow Problem (LBFP) came from the opt...
The original motivation for investigating the Linear Balancing Flow Problem (LBFP) came from the opt...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
Summary. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimiz...
Abstract: The theory and applications of network flows is probabily the most important single tool f...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
The aim of this chapter is to present an overview of the main results for a well-known optimization ...
The original motivation for investigating the Linear Balancing Flow Problem (LBFP) came from the opt...
The original motivation for investigating the Linear Balancing Flow Problem (LBFP) came from the opt...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
Summary. The maximum flow problem is a fundamental problem in graph theory and combinatorial optimiz...
Abstract: The theory and applications of network flows is probabily the most important single tool f...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
Add to ORKG