Pages that link to "Item:Q2513752"
From MaRDI portal
The following pages link to A survey on matheuristics for routing problems (Q2513752):
Displayed 13 items.
- Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
- A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
- Grocery distribution plans in urban networks with street crossing penalties (Q6065827) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- Location‐routing problem: a classification of recent research (Q6092538) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
- Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach (Q6109338) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (Q6201534) (← links)