Pages that link to "Item:Q3281501"
From MaRDI portal
The following pages link to Integer Programming Formulation of Traveling Salesman Problems (Q3281501):
Displaying 6 items.
- A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Bi-objective safe and resilient urban evacuation planning (Q1749521) (← links)
- An improved formulation for the multi-depot open vehicle routing problem (Q5964850) (← links)
