Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems
From MaRDI portal
Publication:6187239
Cites work
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Conditional value‐at‐risk beyond finance: a survey
- Coordination in a retailer‐dominated supply chain with a risk‐averse manufacturer under marketing dependency
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- Implementing automatic benders decomposition in a modern MIP solver
- Introduction to stochastic programming.
- Inventory rebalancing and vehicle routing in bike sharing systems
- Large neighborhood search for the bike request scheduling problem
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Option contract strategies with risk‐aversion and emergency purchase
- Partitioning procedures for solving mixed-variables programming problems
- Risk-averse two-stage stochastic programs in furniture plants
- Stochastic optimization models for a bike-sharing problem with transshipment
- The static bike relocation problem with multiple vehicles and visits
Cited in
(2)
This page was built for publication: Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187239)