A Faster Strongly Polynomial Minimum Cost Flow Algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Finding a feasible flow in a strongly connected network
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Better bounds for minimizing SONET ADMs
- Geometric quadrisection in linear time, with application to VLSI placement
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A strongly polynomial minimum cost circulation algorithm
- The minimal average cost flow problem
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
- Algorithms and complexity analysis for some flow problems
- Routing flow through a strongly connected graph
- A fast algorithm for the minimax flow problem with 0/1 weights
- A polynomial time primal network simplex algorithm for minimum cost flows
- A new strongly polynomial dual network simplex algorithm
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- Monotonizing linear programs with up to two nonzeroes per column
- Polynomial algorithms for a class of minimum rank-two cost path problems
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- The mixed evacuation problem
- On the complexity of energy storage problems
- Minimum-cost flows in unit-capacity networks
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Bi-criteria transportation problem with multiple parameters
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Modifying orthogonal drawings for label placement
- Allocation under a general substitution structure
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
- A network simplex method for the budget-constrained minimum cost flow problem
- A faster polynomial algorithm for the constrained maximum flow problem
- A greedy algorithm for multicut and integral multiflow in rooted trees
- Transportation distances on the circle
- Flow constrained minimum cost flow problem
- The battery switching station scheduling problem
- A linear optimal transportation framework for quantifying and visualizing variations in sets of images
- A new scaling algorithm for the minimum cost network flow problem
- Envy-free matchings with lower quotas
- Many-visits TSP revisited
- Complexity, algorithms and applications of the integer network flow with fractional supplies problem
- A novel approach to subgraph selection with multiple weights on arcs
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- Network flow with intermediate storage: models and algorithms
- A heuristic method for solving integer-valued decompositional multiindex problems
- Shared processor scheduling of multiprocessor jobs
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- A unified framework for clustering constrained data without locality property
- Multimode resource-constrained project scheduling in flexible projects
- Discrete Newton methods for the evacuation problem
- A fast parallel algorithm for minimum-cost small integral flows
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- A faster strongly polynomial time algorithm to solve the minimum cost tension problem
- An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem
- From stars to comets: improved local search for universal facility location
- Matching point sets with respect to the earth mover's distance
- A polynomial algorithm for a two-stage time minimizing transportation problem.
- On the optimum capacity of capacity expansion problems
- Problems of synthesis of connected networks with respect to isomorphic subgraphs
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Separation, dimension, and facet algorithms for node flow polyhedra
- Prim-based support-graph preconditioners for min-cost flow problems
- Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
- Finding optimal non-datapath caching strategies via network flow
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Fast algorithms for convex cost flow problems on circles, lines, and trees
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A scaling out-of-kilter algorithm for minimum cost flow in networks with positive lower bounds
- Minimum-cost flow algorithms: an experimental evaluation
- Profile-based optimal matchings in the student/project allocation problem
- Minimum cost flows in graphs with unit capacities
- The mixed evacuation problem
- Algorithmic aspects of disjunctive total domination in graphs
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- A strongly polynomial algorithm for generalized flow maximization
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- A new approach for solving the minimum cost flow problem with interval and fuzzy data
- A minimum cost flow formulation for approximated MLC segmentation
- Fast algorithms for specially structured minimum cost flow problems with applications
- Algorithms for the simple equal flow problem
- On dual minimum cost flow algorithms (extended abstract)
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
- scientific article; zbMATH DE number 3864952 (Why is no real title available?)
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Approximation algorithms for the single robot line coverage problem
- Dominated parasitic flow loops in networks
- A scaling out-of-kilter algorithm for minimum cost flow
- Smoothed analysis of the successive shortest path algorithm
- An O(nm^ 2) time algorithm for solving minimal cost network flow problems
- scientific article; zbMATH DE number 3900474 (Why is no real title available?)
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- scientific article; zbMATH DE number 4064732 (Why is no real title available?)
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Multiindex transportation problems with 2-embedded structure
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- scientific article; zbMATH DE number 515928 (Why is no real title available?)
This page was built for publication: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288156)
