𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super-modularity: Applications to convex games and to the greedy algorithm for LP

✍ Scribed by Tatsuro Ichiishi

Book ID
115964298
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
186 KB
Volume
25
Category
Article
ISSN
0022-0531

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