M-convex function minimization under l1-distance constraint and its application to dock reallocation in bike-sharing system
Year of publication: |
2022
|
---|---|
Authors: | Shioura, Akiyoshi |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 2, p. 1566-1611
|
Subject: | discrete convex analysis | discrete convex function | proximity-scaling algorithm | resource allocation problem | steepest descent algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Allokation | Allocation |
-
Exact bounds for steepest descent algorithms of L-convex function minimization
Murota, Kazuo, (2014)
-
Deb, Kalyanmoy, (2017)
-
Bueno, L. F., (2024)
- More ...
-
Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis
Murota, Kazuo, (2014)
-
Efficiently Scanning All Spanning Trees of an Undirected Graph
Shioura, Akiyoshi, (1995)
-
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Shioura, Akiyoshi, (2004)
- More ...