Coordinatewise domain scaling algorithm for M-convex function minimization
type: Item
instance of: scholarly article
title: Coordinatewise domain scaling algorithm for M-convex function minimization
zbMATH Open document ID: 1079.90118
author: Akihisa Tamura
published in: Mathematical Programming. Series A. Series B
publication date: 2005-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2159478
zbMATH Keywords: Discrete convex analysis
zbMATH Keywords: M-convex function minimization
zbMATH Keywords: Scaling algorithm
zbMATH Keywords: nonlinear discrete functions
zbMATH Keywords: discrete optimization
MaRDI profile type: Publication
full work available at URL: s10107-004-0522-y
OpenAlex ID: W2157867221
cites work: A Primal-Dual Algorithm for Submodular Flows
cites work: Gross substitution, discrete convexity, and submodularity
cites work: Discrete convexity and equilibria in economies with indivisible goods and money
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Valuated matroids
cites work: Q5684698
cites work: Q4149476
cites work: Q3684133
cites work: Generalized polymatroids and submodular flows
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: Submodular functions and optimization
cites work: A Note on Kelso and Crawford's Gross Substitutes Condition
cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region
cites work: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
cites work: A fully combinatorial algorithm for submodular function minimization.
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: Q4548801
cites work: Convexity and Steinitz's exchange property
cites work: Discrete convex analysis
cites work: Submodular flow problem with a nonseparable cost function
cites work: Matrices and matroids for systems analysis
cites work: Discrete Convex Analysis
cites work: Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
cites work: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
cites work: Application of M-convex submodular flow problem to mathematical economics
cites work: Convex Analysis
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Minimization of an M-convex function
cites work: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
DOI: 10.1007/S10107-004-0522-Y
description: scientific article; zbMATH DE number 2159478