Geometric Rescaling Algorithms for Submodular Function Minimization
From MaRDI portal
Publication:4958557
DOI10.1287/MOOR.2020.1064zbMath1477.90081OpenAlexW3181108085MaRDI QIDQ4958557
Dan Dadush, Giacomo Zambelli, László A. Végh
Publication date: 14 September 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/27622
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A faster strongly polynomial time algorithm for submodular function minimization
- A strongly polynomial minimum cost circulation algorithm
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- A descent method for submodular function minimization
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A note on submodular function minimization by Chubanov's LP algorithm
- An improved deterministic rescaling for linear programming algorithms
- Submodular functions and optimization.
- An Efficient Rescaled Perceptron Algorithm for Conic Systems
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Finding the nearest point in A polytope
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- Subquadratic submodular function minimization
- Rescaling Algorithms for Linear Conic Feasibility
- Learning with Submodular Functions: A Convex Optimization Perspective
- A simple polynomial-time rescaling algorithm for solving linear programs
- A deterministic rescaled perceptron algorithm
This page was built for publication: Geometric Rescaling Algorithms for Submodular Function Minimization
