scientific article
From MaRDI portal
Publication:3076645
zbMath1208.65086MaRDI QIDQ3076645
Satoru Fujishige, Shigueo Isotani
Publication date: 23 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmsnumerical examplessubmodular functionsubmodular function minimizationbase polyhedroncombinatorial polynomial algorithmsminimum norm pointminimum-norm-point algorithm
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)
Related Items
Structured Sparsity: Discrete and Convex Approaches, Unnamed Item, Unnamed Item, On a Reduction for a Class of Resource Allocation Problems, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Riemannian optimization via Frank-Wolfe methods, An update-and-stabilize framework for the minimum-norm-point problem, Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization, A competitive solution for cooperative truckload delivery, Geometric Rescaling Algorithms for Submodular Function Minimization, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
