Pages that link to "Item:Q925838"
From MaRDI portal
The following pages link to A heuristic manipulation technique for the sequential ordering problem (Q925838):
Displaying 16 items.
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
- Heuristic manipulation, tabu search and frequency assignment (Q1038293) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- Subproblem ordering heuristics for AND/OR best-first search (Q1745717) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Constrained shortest path tour problem: branch-and-price algorithm (Q2147106) (← links)
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers (Q2350866) (← links)
- On the sequential ordering problems (Q2715585) (← links)
- Sequencing with ordered criteria, precedence and group technology constraints (Q2731287) (← links)
- Tree based models and algorithms for the preemptive asymmetric stacker crane problem (Q2907956) (← links)
- Heuristic Methods for Selection and Ordering of Part-Orienting Devices (Q3483066) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)
