The following pages link to Maxence Delorme (Q323471):
Displaying 13 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- Improved instance generation for kidney exchange programmes (Q2669768) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Half-cycle: a new formulation for modelling kidney exchange problems (Q6106526) (← links)
- Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem (Q6122093) (← links)
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints (Q6551087) (← links)
- New algorithms for hierarchical optimization in kidney exchange programs (Q6598922) (← links)
