๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Coordinatewise domain scaling algorithm for M-convex function minimization

โœ Scribed by Akihisa Tamura

Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
182 KB
Volume
102
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast scaling algorithms for M-convex fun
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
โœ Akiyoshi Shioura ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 256 KB

M-convex functions, introduced by Murota (Adv. Math. 124 (1996) 272; Math. Prog. 83 (1998) 313), enjoy various desirable properties as "discrete convex functions." In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply

A capacity scaling algorithm for M-conve
A capacity scaling algorithm for M-convex submodular flow
โœ Satoru Iwata; Satoko Moriguchi; Kazuo Murota ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 229 KB

This paper presents a faster algorithm for the M-convex submodular How problem, which is a generalization of the minimum-cost How problem with an M-convex cost function for the How-boundary, where an M-convex function is a nonlinear nonseparable cliserete convex function on integer points. The algor