Pages that link to "Item:Q4193265"
From MaRDI portal
The following pages link to Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound (Q4193265):
Displayed 6 items.
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- Testing integer knapsacks for feasibility (Q1266633) (← links)
- On the Bellman's principle of optimality (Q1619876) (← links)
- On Some Special Network Flow Problems: The Shortest Path Tour Problems (Q5326892) (← links)