A capacity scaling algorithm for M-convex submodular flow
From MaRDI portal
Recommendations
- Integer Programming and Combinatorial Optimization
- Capacity scaling algorithm for scalable M-convex submodular flow problems
- A capacity scaling algorithm for convex cost submodular flows
- A faster capacity scaling algorithm for minimum cost submodular flow
- A fast cost scaling algorithm for submodular flow
Cites work
- A capacity scaling algorithm for convex cost submodular flows
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A faster capacity scaling algorithm for minimum cost submodular flow
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- A Primal-Dual Algorithm for Submodular Flows
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Application of M-convex submodular flow problem to mathematical economics
- Capacity scaling algorithm for scalable M-convex submodular flow problems
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- Convexity and Steinitz's exchange property
- Discrete Convex Analysis
- Discrete convex analysis
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Finding feasible vectors of Edmonds-Giles polyhedra
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1342135 (Why is no real title available?)
- scientific article; zbMATH DE number 2086911 (Why is no real title available?)
- Layered Augmenting Path Algorithms
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Minimizing a Convex Cost Closure Set
- New algorithms for the intersection problem of submodular systems
- Solving the convex cost integer dual network flow problem
- Submodular flow problem with a nonseparable cost function
- Submodular functions and optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
Cited in
(19)- Submodular flow problem with a nonseparable cost function
- A capacity scaling algorithm for convex cost submodular flows
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
- Scaling, proximity, and optimization of integrally convex functions
- Ameso optimization: a relaxation of discrete midpoint convexity
- A fast cost scaling algorithm for submodular flow
- Recent developments in discrete convex analysis
- Capacity scaling algorithm for scalable M-convex submodular flow problems
- scientific article; zbMATH DE number 2080975 (Why is no real title available?)
- A capacity scaling algorithm for the constrained maximum flow problem
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- Competitive equilibrium and trading networks: a network flow approach
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Discrete midpoint convexity
- Integer Programming and Combinatorial Optimization
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
This page was built for publication: A capacity scaling algorithm for M-convex submodular flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777220)
