Pages that link to "Item:Q1194853"
From MaRDI portal
The following pages link to A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853):
Displaying 13 items.
- Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- An application of parallel virtual machine framework to film production problem (Q1569971) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- On the Use of a Mixed Integer Non-linear Programming Model for Refrigerant Design (Q4368601) (← links)
