The following pages link to James P. Kelly (Q541995):
Displaying 18 items.
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
- The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- A scatter-search-based learning algorithm for neural network training (Q1357486) (← links)
- Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
- (Q1813910) (redirect page) (← links)
- The controlled rounding problem: Relaxations and complexity issues (Q1813913) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- Large-scale controlled rounding using tabu search with strategic oscillation (Q2366995) (← links)
- Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization (Q2892345) (← links)
- Controlled Rounding of Tabular Data (Q3356124) (← links)
- Cell suppression: Disclosure protection for sensitive tabular data (Q4018997) (← links)
- Using Simulated Annealing to Solve Controlled Rounding Problems (Q4029058) (← links)
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem (Q4346449) (← links)
- (Q4350034) (← links)
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem (Q4427373) (← links)
- (Q4955265) (← links)
