M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
From MaRDI portal
Publication:5085152
DOI10.1287/moor.2021.1180zbMath1489.90164OpenAlexW4200571206MaRDI QIDQ5085152
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1180
steepest descent algorithmresource allocation problemdiscrete convex analysisdiscrete convex functionproximity-scaling algorithm
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems, Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
Cites Work
- Unnamed Item
- Convexity and Steinitz's exchange property
- Discrete convex analysis
- Minimization of an M-convex function
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Coordinatewise domain scaling algorithm for M-convex function minimization
- A capacity scaling algorithm for M-convex submodular flow
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Submodular functions and optimization.
- M-Convex Function on Generalized Polymatroid
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Discrete Convex Analysis
- On Steepest Descent Algorithms for Discrete Convex Functions
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- On Fundamental Operations for Multimodular Functions
- Note on Multimodularity and L-Convexity
