Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(only showing first 100 items - show all)

Approximate labelled subtree homeomorphism
Finding optimal paths in MREP routing
Maximum weight bipartite matching in matrix multiplication time
An approach to the parallel solution of a high-dimensional basic flow problem
The attractive traveling salesman problem
A solution method for the non-additive resource allocation problem in distributed system design
The optimum assignments and a new heuristic approach for the traveling salesman problem
Testing membership in matroid polyhedra
An out-of-kilter method for the algebraic circulation problem
An efficient algorithm for the bipartite matching problem
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
Invariant sets of arcs in network flow problems
An improvement of Dijkstra's method for finding a shortest path in a graph
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
An introduction to parallelism in combinatorial optimization
A strongly polynomial minimum cost circulation algorithm
Scaling algorithms for network problems
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Algorithms for finding k-best perfect matchings
A very personal reminiscence on the problem of computational complexity
Primal-dual algorithms for the assignment problem
Scheduling jobs with fixed start and end times
An application of simultaneous diophantine approximation in combinatorial optimization
River routing in VLSI
Constructing a perfect matching is in random NC
An extension of the König-Egerváry property to node-weighted bidirected graphs
A computational study of efficient shortest path algorithms
Dual coordinate step methods for linear network flow problems
A new algorithm for the directed Chinese postman problem
Subspaces with well-scaled frames
Penelope's graph: a hard minimum cost tension instance
A parametric maximum flow algorithm for bipartite graphs with applications
Algebraic flows in regular matroids
An \(O(EV\log^2V)\) algorithm for the maximal flow problem
An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
On the theoretical efficiency of various network flow algorithms
A new algorithm to find the shortest paths between all pairs of nodes
Optimal cocircuits in regular matroids and applications
Complexity of linear programming
Unit disk graphs
On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
Finding minimum-cost flows by double scaling
On the computational behavior of a polynomial-time network flow algorithm
Negative circuits for flows and submodular flows
Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
Coflow polyhedra
A new Karzanov-type O(n^ 3) max-flow algorithm
Matching theory -- a sampler: From Dénes König to the present
Maximum \(k\)-covering of weighted transitive graphs with applications
Optimal multiple interval assignments in frequency assignment and traffic phasing
A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy
Numerical investigations on the maximal flow algorithm of Karzanov
Testing the necklace condition for shortest tours and optimal factors in the plane
An efficient algorithm for minimum-weight bibranching
Computational investigations of maximum flow algorithms
Routing trains through railway stations: Complexity issues
Parallel algorithm to find maximum capacity paths
Constructing a course schedule by solving a series of assignment type problems
Test sets of integer programs
On the maximum capacity augmentation algorithm for the maximum flow problem
Tight bounds on the number of minimum-mean cycle cancellations and related results
A new saling algorithm for the maximum mean cut problem
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Algorithms and complexity analysis for some flow problems
Parallel algorithms for the assignment and minimum-cost flow problems
The auction algorithm: A distributed relaxation method for the assignment problem
Balancing problems in acyclic networks
Two-edge connected spanning subgraphs and polyhedra
Analysis of linear structured systems using a primal-dual algorithm
A capacity scaling algorithm for convex cost submodular flows
On perfectly two-edge connected graphs
A new strongly polynomial dual network simplex algorithm
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Multiflows and disjoint paths of minimum total cost
Minimum cut problem using bases of extended polymatroids
Optimal scheduling in CDMA packet radio networks
Planning of high school examinations in Denmark
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
An algorithmic study of the maximum flow problem: A comparative statistical analysis
Improved filtering for the bin-packing with cardinality constraint
The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
Solving MIPs via scaling-based augmentation
A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Scheduling for electricity cost in a smart grid
Convexification of generalized network flow problem
Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
Refinement to imperative HOL
Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
Shortest augmenting paths for online matchings on trees
Critical objective function values in linear sum assignment problems
Greedy oriented flows
Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
On graphs of the cone decompositions for the min-cut and max-cut problems
Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
Colocating tasks in data centers using a side-effects performance model
The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

This page was built for publication: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4080986)