Pages that link to "Item:Q1302601"
From MaRDI portal
The following pages link to New parallel randomized algorithms for the traveling salesman problem (Q1302601):
Displaying 8 items.
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment (Q2485930) (← links)
- (Q3820397) (← links)
- The parallel complexity of TSP heuristics (Q4729351) (← links)
- Simulation Optimization for MRO Systems Operations (Q4978462) (← links)