The following pages link to Axel Parmentier (Q515181):
Displayed 16 items.
- A mathematical framework for delay analysis in single source networks (Q515183) (← links)
- Learning when to use a decomposition (Q2011591) (← links)
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
- Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
- Learning to Approximate Industrial Problems by Operations Research Classic Problems (Q5031031) (← links)
- Future memories are not needed for large classes of POMDPs (Q6106534) (← links)
- Aircraft routing and crew pairing: updated algorithms at Air France (Q6288139) (← links)
- Resource constrained shortest path algorithm for EDF short-term thermal production planning problem (Q6306159) (← links)
- Ground staff shift planning under delay uncertainty at Air France (Q6309059) (← links)
- Linear Programming for Decision Processes with Partial Information (Q6310057) (← links)
- Integer programming on the junction tree polytope for influence diagrams (Q6314275) (← links)
- Two generalizations of Markov blankets (Q6315283) (← links)
- Integer programming for weakly coupled stochastic dynamic programs with partial information (Q6355044) (← links)
- Electric Vehicle Fleets: Scalable Route and Recharge Scheduling through Column Generation (Q6364835) (← links)
- Linear lexicographic optimization and preferential bidding system (Q6388866) (← links)
- Solving a Continent-Scale Inventory Routing Problem at Renault (Q6409465) (← links)