Minimizing multimodular functions and allocating capacity in bike-sharing systems
From MaRDI portal
Publication:2401156
DOI10.1007/978-3-319-59250-3_16zbMath1418.90164arXiv1611.09304OpenAlexW2971467683WikidataQ55390788 ScholiaQ55390788MaRDI QIDQ2401156
Daniel Freund, Shane G. Henderson, David B. Shmoys
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1611.09304
Related Items (11)
A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS ⋮ Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems ⋮ M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Limiting the oscillations in queues with delayed information through a novel type of delay announcement ⋮ Unnamed Item ⋮ Nonlinear Dynamics in Queueing Theory: Determining the Size of Oscillations in Queues with Delay ⋮ A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem ⋮ Data-Driven Rebalancing Methods for Bike-Share Systems ⋮ Optimizing large on-demand transportation systems through stochastic conic programming ⋮ On basic operations related to network induction of discrete convex functions
This page was built for publication: Minimizing multimodular functions and allocating capacity in bike-sharing systems
