M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
DOI10.1287/MOOR.2021.1180zbMATH Open1489.90164OpenAlexW4200571206MaRDI QIDQ5085152FDOQ5085152
Authors: Akiyoshi Shioura 
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
Recommendations
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Stochastic optimization models for a bike-sharing problem with transshipment
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Cost-efficient allocation of bikes to stations in bike sharing systems
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)
Cites Work
- Discrete Convex Analysis
- Submodular functions and optimization.
- Title not available (Why is that?)
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Note on Multimodularity and L-Convexity
- Convexity and Steinitz's exchange property
- \(M\)-convex function on generalized polymatroid
- Discrete convex analysis
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- On Steepest Descent Algorithms for Discrete Convex Functions
- Minimization of an M-convex function
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
- Coordinatewise domain scaling algorithm for M-convex function minimization
- A capacity scaling algorithm for M-convex submodular flow
- On fundamental operations for multimodular functions
Cited In (2)
This page was built for publication: M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085152)
