CDT
From MaRDI portal
swMATH116MaRDI QIDQ12886FDOQ12886
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=212066.212084
Cited In (12)
- Title not available (Why is that?)
- An automata network for performing combinatorial optimization
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Exact solution of the generalized routing problem through graph transformations
- Multiperiod location-routing with decoupled time scales
- A compact model and tight bounds for a combined location-routing problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Exact solution of large-scale, asymmetric traveling salesman problems
- MCF
- NAGWare
- Bison
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
This page was built for software: CDT
