Decreasing minimization on base-polyhedra: relation between discrete and continuous cases

DOI10.1007/S13160-022-00511-4MaRDI QIDQ2111551zbMATH OpenOpenAlexFDO

Authors András Frank, Kazuo Murota

Publication date 17 January 2023

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.06561

zbMATH Keywords

decomposition algorithmlexicographic optimizationM-convex setprincipal partitionbase-polyhedrondecreasing minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Decreasing minimization on M-convex sets: background and structures
• Decreasing minimization on M-convex sets: algorithms and applications
• On Convex Minimization over Base Polytopes
• Equivalence of convex minimization problems over base polytopes
• Discrete L-convex function minimization based on continuous relaxation

Cites work

• scientific article; zbMATH DE number 3750964 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A Concept of Egalitarianism Under Participation Constraints
• A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
• A submodular function minimization algorithm based on the minimum-norm base
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity and algorithms for nonlinear optimization problems
• Connections in combinatorial optimization
• Decreasing minimization on M-convex sets: algorithms and applications
• Decreasing minimization on M-convex sets: background and structures
• Discrete Convex Analysis
• Discrete Newton's algorithm for parametric submodular function minimization
• Discrete convex analysis
• Finding the nearest point in A polytope
• Inequalities: theory of majorization and its applications
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
• On basic operations related to network induction of discrete convex functions
• Optimal flows in networks with multiple sources and sinks
• Recent developments in discrete convex analysis
• Semi-matchings for bipartite graphs and load balancing
• Submodular functions and optimization
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
• The egalitarian solution and reduced game properties in convex games
• Theory of principal partitions revisited
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region

Cited in

(6)

• Recent progress on integrally convex functions
• Equivalence of convex minimization problems over base polytopes
• Fair integral submodular flows
• Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases
• Decreasing minimization on M-convex sets: background and structures
• Decreasing minimization on M-convex sets: algorithms and applications

This page was built for publication: Decreasing minimization on base-polyhedra: relation between discrete and continuous cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111551)