A polynomial time primal network simplex algorithm for minimum cost flows
From MaRDI portal
Recommendations
Cites work
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A network simplex method
- A new strongly polynomial dual network simplex algorithm
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A strongly polynomial minimum cost circulation algorithm
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- Efficient Shortest Path Simplex Algorithms
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost flows by double scaling
- scientific article; zbMATH DE number 432783 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- On the simplex algorithm for networks and generalized networks
- Polynomial dual network simplex algorithms
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- The Scaling Network Simplex Algorithm
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Cited in
(67)- A strongly polynomial simplex method for the linear fractional assignment problem
- A note on a generalized network flow model for manufacturing process
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- GNU Oflox: an academic software for the minimal cost network flow problem
- Solving the moving target search problem using indistinguishable searchers
- A network simplex method for the budget-constrained minimum cost flow problem
- Scheduling in-house transport vehicles to feed parts to automotive assembly lines
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- EMDUniFrac: exact linear time computation of the UniFrac metric and identification of differentially abundant organisms
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
- A simplex algorithm for network flow problems with piecewise linear fractional objective function
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- One-dimensional service networks and batch service queues
- A novel approach to subgraph selection with multiple weights on arcs
- Balanced-flow algorithm for path network planning in hierarchical spaces
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- An iterative security game for computing robust and adaptive network flows
- Optimal distributed searching in the plane with and without uncertainty
- Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
- Quadratically regularized optimal transport on graphs
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- A minimum cost network flow model for the maximum covering and patrol routing problem
- 3/4-discrete optimal transport
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- Random walks on the vertices of transportation polytopes with constant number of sources
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- The Scaling Network Simplex Algorithm
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Multiscale strategies for computing optimal transport
- scientific article; zbMATH DE number 795215 (Why is no real title available?)
- Exterior point simplex-type algorithms for linear and network optimization problems
- On the length of monotone paths in polyhedra
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma
- Modular circulation and applications to traffic management
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Budget-feasible mechanisms for proportionally selecting agents from groups
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- The octatope abstract domain for verification of neural networks
- A least-squares minimum-cost network flow algorithm
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
- Minimal number of periodic orbits for non-singular Morse-Smale flows in odd dimension
- Unbalanced optimal transport, from theory to numerics
- Combating confirmation bias: a unified pseudo-labeling framework for entity alignment
- Maximum flow and minimum-cost flow in almost-linear time
- On combinatorial network flows algorithms and circuit augmentation for pseudoflows
- A regularized interior point method for sparse optimal transport on graphs
- On variants of a load-balancing problem with unit-load jobs
- Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
- A sparse smoothing Newton method for solving discrete optimal transport problems
- On the number of degenerate simplex pivots
- On strings having the same length-k substrings
- Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty
- On the number of degenerate simplex pivots
- A fast polynomial time algorithm for logistics network flows
- An exterior simplex type algorithm for the minimum cost network flow problem
This page was built for publication: A polynomial time primal network simplex algorithm for minimum cost flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373741)
