Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
From MaRDI portal
Publication:5058035
DOI10.1287/opre.2022.2320zbMath1502.90022OpenAlexW2951286848WikidataQ113239958 ScholiaQ113239958MaRDI QIDQ5058035
Daniel Freund, Shane G. Henderson, David B. Shmoys
Publication date: 1 December 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2022.2320
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The static bicycle relocation problem with demand intervals
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Convexity and Steinitz's exchange property
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Discrete convex analysis
- Notes on L-/M-convex functions and the separation theorems
- Shared mobility systems: an updated survey
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Inventory rebalancing and vehicle routing in bike sharing systems
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Bike sharing systems: solving the static rebalancing problem
- M-Convex Function on Generalized Polymatroid
- Multimodularity, Convexity, and Optimization Properties
- On the Structure of Lost-Sales Inventory Models
- Extremal Splittings of Point Processes
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Discrete Convex Analysis
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Discrete Midpoint Convexity
- Data-Driven Rebalancing Methods for Bike-Share Systems
- Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems
- Order-Based Cost Optimization in Assemble-to-Order Systems
- Foundations and methods of stochastic simulation. A first course
