Finding minimum-cost circulations by canceling negative cycles
From MaRDI portal
Publication:3474897
Recommendations
- Finding Minimum-Cost Circulations by Successive Approximation
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- scientific article; zbMATH DE number 3900474
- A strongly polynomial minimum cost circulation algorithm
Cited in
(74)- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
- Steiner problems with limited number of branching nodes
- Multicommodity network flows: A survey. II: Solution methods
- Linear fractional approximations for master problems in column generation
- A direct barter model for course add/drop process
- On circuit diameter bounds via circuit imbalances
- Linking and cutting spanning trees
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- Evacuation planning by earliest arrival contraflow
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- An algorithm to compute the nucleolus of shortest path games
- Minimum-cost flow algorithms: an experimental evaluation
- Chips on wafers, or packing rectangles into grids
- Improved filtering for the bin-packing with cardinality constraint
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- Fractional 0-1 programming: applications and algorithms
- Maximum contraflow evacuation planning problems on multi-network
- Complexity analysis for maximum flow problems with arc reversals
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- Influence of the normalization constraint on the integral simplex using decomposition
- Profit maximization in flex-grid all-optical networks
- A bicriteria almost equal minimum cost flow model for day-ahead trading
- Dominated parasitic flow loops in networks
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Network flow optimization with minimum quantities
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- A strongly polynomial algorithm for generalized flow maximization
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- A strongly polynomial contraction-expansion algorithm for network flow problems
- The minimum mean cycle-canceling algorithm for linear programs
- On circuit diameter bounds via circuit imbalances
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- Finding minimum-cost flows by double scaling
- Penelope's graph: a hard minimum cost tension instance
- scientific article; zbMATH DE number 3847193 (Why is no real title available?)
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- Approximate binary search algorithms for mean cuts and cycles
- Minimal number of periodic orbits for non-singular Morse-Smale flows in odd dimension
- A strongly polynomial algorithm for the minimum cost tension problem
- Maximum network flows with concave gains
- Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory
- Dynamic network contraflow evacuation planning problem with continuous time approach
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Modular circulation and applications to traffic management
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- Balanced-flow algorithm for path network planning in hierarchical spaces
- On solving maximum and quickest interval-valued flows over time
- Margin of victory for tournament solutions
- Decomposition theorems for linear programs
- Minimum cost multiflows in undirected networks
- Smoothed analysis of the successive shortest path algorithm
- Node-balancing by edge-increments
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Data locality and replica aware virtual cluster embeddings
- A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
- About the minimum mean cycle-canceling algorithm
- A new saling algorithm for the maximum mean cut problem
- The hexatope and octatope abstract domains for neural network verification
- Profit maximization in flex-grid all-optical networks
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- The octatope abstract domain for verification of neural networks
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Engineering Negative Cycle Canceling for Wind Farm Cabling
- Computing maximum mean cuts
- Sparse PCA on fixed-rank matrices
- Belief propagation for unbalanced assignment problem
- Tight bounds on the number of minimum-mean cycle cancellations and related results
This page was built for publication: Finding minimum-cost circulations by canceling negative cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474897)
