M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System

DOI10.1287/MOOR.2021.1180MaRDI QIDQ5085152zbMATHOpenAlexFDO

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

zbMATH Keywords

steepest descent algorithmresource allocation problemdiscrete convex analysisdiscrete convex functionproximity-scaling algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

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

Cites work

• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• A capacity scaling algorithm for M-convex submodular flow
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
• Convexity and Steinitz's exchange property
• Coordinatewise domain scaling algorithm for M-convex function minimization
• Discrete Convex Analysis
• Discrete convex analysis
• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
• Minimization of an M-convex function
• Minimizing multimodular functions and allocating capacity in bike-sharing systems
• Note on Multimodularity and L-Convexity
• On Steepest Descent Algorithms for Discrete Convex Functions
• On fundamental operations for multimodular functions
• Submodular functions and optimization.
• \(M\)-convex function on generalized polymatroid

Cited in

(2)

• Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
• Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems

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)