Pages that link to "Item:Q1848588"
From MaRDI portal
The following pages link to An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588):
Displayed 4 items.
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Quality inspection scheduling for multi-unit service enterprises (Q953432) (← links)
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms (Q2432849) (← links)
- Advanced planning and scheduling based on precedence and resource constraints for e-plant chains (Q3159643) (← links)