Pages that link to "Item:Q1652651"
From MaRDI portal
The following pages link to Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651):
Displaying 13 items.
- Constraint programming and operations research (Q1616390) (← links)
- Multi-warehouse package consolidation for split orders in online retailing (Q2029283) (← links)
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms (Q2664292) (← links)
- Network scheduling problem with cross-docking and loading constraints (Q2668719) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- A data-driven matching algorithm for ride pooling problem (Q2669782) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems (Q5106415) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)