The following pages link to Luce Brotcorne (Q238103):
Displaying 22 items.
- Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers (Q291314) (← links)
- (Q325368) (redirect page) (← links)
- Mathematical programming with stochastic equilibrium constraints applied to optimal last-mile delivery services (Q325369) (← links)
- An exact algorithm for the network pricing problem (Q429686) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- A tabu search algorithm for the network pricing problem (Q1761203) (← links)
- Ambulance location and relocation models. (Q1872997) (← links)
- One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532) (← links)
- Strategic bidding in price coupled regions (Q2155379) (← links)
- Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
- A three-phase matheuristic for the packaging and shipping problem (Q2307048) (← links)
- A trilevel model for best response in energy demand-side management (Q2333005) (← links)
- Revenue optimization in energy networks involving self-scheduled demand and a smart grid (Q2669487) (← links)
- Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
- A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem (Q2783890) (← links)
- A bilevel approach to optimize electricity prices (Q3388404) (← links)
- Joint Design and Pricing on a Network (Q3392235) (← links)
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network (Q4411198) (← links)
- (Q4811395) (← links)
- Fast heuristics for large scale covering-location problems (Q5959388) (← links)
- Fill‐rate service level constrained distribution network design (Q6060687) (← links)
- Bilevel Programming: The Montreal School (Q6160370) (← links)
