Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(only showing first 100 items - show all)

Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
Routing trains through railway stations: Complexity issues
The traveling salesman problem: An update of research
Disjoint paths in a network
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
New solutions for disjoint paths in P systems
On the fast delivery problem with one or two packages
Enumerating \(k\)-arc-connected orientations
River routing in VLSI
Vertex deletion into bipartite permutation graphs
Complexity and algorithms for nonlinear optimization problems
Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
A very personal reminiscence on the problem of computational complexity
An algorithmic study of the maximum flow problem: A comparative statistical analysis
A parallel algorithm for eliminating cycles in undirected graphs
TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
A new model and algorithm design of pooling problem
Learning-augmented maximum flow
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
A computational study of efficient shortest path algorithms
An extension of the König-Egerváry property to node-weighted bidirected graphs
Minimum cut problem using bases of extended polymatroids
Min-Cost Flow in Unit-Capacity Planar Graphs
Rényi 100, quantitative and qualitative (in)dependence
The -maximum flow model with uncertain capacities
Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
My experiences as a student and researcher in OR during the 1960's and 70's
A submodular optimization problem with side constraints
Lexicographic optimal homologous chains and applications to point cloud triangulations
A sequential algorithm for finding a maximum weightK-independent set on interval graphs
Euclidean maximum matchings in the plane -- local to global
Generalized disk graphs
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Maximum weightk-independent set problem on permutation graphs
The importance of memory for price discovery in decentralized markets
Optimal transport: discretization and algorithms
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
On implementing push-relabel method for the maximum flow problem
Non-standard approaches to integer programming
Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
ReLU neural networks of polynomial size for exact maximum flow computation
Submodular function minimization
Computing the largest bond and the maximum connected cut of a graph
Minimal-cost network flow problems with variable lower bounds on arc flows
Maximum likelihood estimation of Gaussian mixture models using stochastic search
Simplifying maximum flow computations: the effect of shrinking and good initial flows
Topologically trivial closed walks in directed surface graphs
Stackelberg bipartite vertex cover and the preflow algorithm
Quick max-flow algorithm
Optimal project compression with due-dated events
Cost operator algorithms for the transportation problem
Editing to a connected graph of given degrees
Matching supply and demand in a sharing economy: classification, computational complexity, and application
Maximum bipartite flow in networks with adaptive channel width
Popular mixed matchings
Numerical investigations on the maximal flow algorithm of Karzanov
A simple GAP-canceling algorithm for the generalized maximum flow problem
Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
Approximate solutions of capacitated fixed-charge minimum cost network flow problems
Maximum flow in hybrid network with intermediate storage
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
Stability of the bipartite matching model
Refinement to imperative HOL
Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
Approximating the discrete time-cost tradeoff problem with bounded depth
The continuous maximum capacity path interdiction problem
Network flow methods for the minimum covariate imbalance problem
Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
Short simplex paths in lattice polytopes
Bottleneck flows in unit capacity networks
Minimum-cost flow algorithms: an experimental evaluation
Automatic graph-based local edge detection
A fast parallel algorithm for minimum-cost small integral flows
Chips on wafers, or packing rectangles into grids
Exact Solution Algorithms for the Chordless Cycle Problem
Second-price ad auctions with binary bids and markets with good competition
The integer \(\{k\}\)-domination number of circulant graphs
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
On chromatic number and minimum cut
Methods for the graph realization problem
Solving the optimum communication spanning tree problem
scientific article; zbMATH DE number 7626795 (Why is no real title available?)
Efficient computation of all tolerances in the sparse maxmin path problem
0/1-Integer programming: Optimization and Augmentation are equivalent
On packing and coloring hyperedges in a cycle
Computing a maximum clique in geometric superclasses of disk graphs
Optimal scheduling in CDMA packet radio networks
Improved filtering for the bin-packing with cardinality constraint
Primal-dual target-following algorithms for linear programming
Critical objective function values in linear sum assignment problems
Shortest augmenting paths for online matchings on trees
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Solving the list coloring problem through a branch-and-price algorithm
Scaling algorithms for network problems
A new strategy for the undirected two-commodity maximum flow problem
Parallel algorithms for bipartite matching problems on distributed memory computers
Scheduling jobs with fixed start and end times

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)