Showing results 3 to 14 of 14
< previous
Issue Date | Title | Author(s) |
2008 | Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem | Consoli, S; Moreno-Pérez, J A; Darby-Dowman, K; Mladenović, N |
2009 | Discrete particle swarm optimization for the minimum labelling Steiner tree problem | Consoli, S; Moreno-Pérez, JA; Darby-Dowman, K; Mladenović, N |
2005 | An improved adaptive neural network for job-shop scheduling | Yang, S |
2010 | An improved constraint satisfaction adaptive neural network for job-shop scheduling | Yang, S; Wang, D; Chai, T; Kendall, G |
2016 | Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem | Mansouri, SA; Aktas, E |
1999 | A neural network and heuristics hybrid strategy for job-shop scheduling problem | Yang, S; Wang, D |
2001 | A new adaptive neural network and heuristics hybrid approach for job-shop scheduling | Yang, S; Wang, D |
2010 | New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering | Lazić, Jasmina |
2004 | Pooling problem: Alternate formulations and solution methods | Audet, C; Brimberg, J; Hansen, P; Le Digabel, S; Mladenović, N |
2003 | Solving the p-center problem with tabu search and variable neighborhood search | Mladenović, N; Labbe, M; Hansen, P |
2004 | A Two Stage Parallel Branch and Bound Algorithm for Mixed Integer programs | Nwana, V; Darby-Dowman, K; Mitra, G |
1999 | Using constraint satisfaction adaptive neural network and efficient heuristics for job-shop scheduling | Yang, S; Wang, D |