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

DOI10.1007/s13160-022-00511-4OpenAlexW4221145288MaRDI QIDQ2111551

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)

Related Items

Fair integral submodular flows, Recent progress on integrally convex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The egalitarian solution and reduced game properties in convex games
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Submodular functions and optimization
• Discrete convex analysis
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• Decreasing minimization on M-convex sets: background and structures
• Decreasing minimization on M-convex sets: algorithms and applications
• Discrete Newton's algorithm for parametric submodular function minimization
• Complexity and algorithms for nonlinear optimization problems
• A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
• Theory of Principal Partitions Revisited
• Recent Developments in Discrete Convex Analysis
• M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
• A Concept of Egalitarianism Under Participation Constraints
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Optimal flows in networks with multiple sources and sinks
• Finding the nearest point in A polytope
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
• Discrete Convex Analysis
• 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
• Semi-matchings for bipartite graphs and load balancing
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• Inequalities: theory of majorization and its applications