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

DOI10.1007/S13160-022-00511-4OpenAlexW4221145288MaRDI QIDQ2111551FDOQ2111551

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

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

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)

Cites Work

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

Cited In (6)

• Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases
• Recent progress on integrally convex functions
• Equivalence of convex minimization problems over base polytopes
• Fair integral submodular flows
• 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)