Pages that link to "Item:Q5246831"
From MaRDI portal
The following pages link to A set covering based matheuristic for a real‐world city logistics problem (Q5246831):
Displaying 5 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
