Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 3421698 (Why is no real title available?)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Bike sharing systems: solving the static rebalancing problem
- Convexity and Steinitz's exchange property
- Data-driven rebalancing methods for bike-share systems
- Discrete Convex Analysis
- Discrete convex analysis
- Discrete midpoint convexity
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Extremal Splittings of Point Processes
- Foundations and methods of stochastic simulation. A first course
- Inventory rebalancing and vehicle routing in bike sharing systems
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems
- Multimodularity, convexity, and optimization properties
- Notes on L-/M-convex functions and the separation theorems
- On the Structure of Lost-Sales Inventory Models
- Order-Based Cost Optimization in Assemble-to-Order Systems
- Shared mobility systems: an updated survey
- The static bicycle relocation problem with demand intervals
- \(M\)-convex function on generalized polymatroid
Cited in
(8)- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems
- Stochastic optimization models for a bike-sharing problem with transshipment
- Cost-efficient allocation of bikes to stations in bike sharing systems
- Joint optimization of the inventory routing problem considering the recycling of broken bikes in the bike-sharing system
- Microscopic traffic models, accidents, and insurance losses
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems
This page was built for publication: Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058035)
