In Journals with review process

• N. Zufferey, M. Verma, Tabu search for shipping dangerous goods in a rail-truck network, Research in Logistics & Production 3, 127 – 137, 201

• M. Verma, V. Verter, N. Zufferey, A Bi-Objective Model for Planning and Managing Rail-Truck Intermodal Transportation of Hazardous Materials, Transportation Research E: Logistics and Transportation Review, accepted in 2011

• N. Zufferey, Optimization by Ant Algorithms: Possible Roles for an Individual Ant, Optimization Letters, DOI: 10.1007/s11590-011-0327-x, accepted in 2011

• N. Zufferey, O. Labarthe, D. Schindl, Heuristics for a Project Management Problem with Incompatibility and Assignment Costs, Computational Optimization and Applications, on-line since December 2, 2010, DOI: 10.1007/s10589-010-9380-0

• H. Amrani, A. Martel, N. Zufferey, P. Makeeva, A Variable Neighborhood Search Heuristic for the Design of Multicommodity Production-Distribution Networks with Alternative Facility Configurations, OR Spectrum, on-line since October 4, 2009, DOI: 10.1007/s00291-009-0182-7)

• S. Lorini, J.-Y. Potvin, N. Zufferey, Online Vehicle Routing and Scheduling with Dynamic Travel Times, Computers & Operations Research 38 (7), 1086 – 1090, 2011

• E. A. Silver, N. Zufferey, Inventory Control of an Item with a Probabilistic Replenishment Lead Time and a Known Supplier Shutdown Period, International Journal of Production Research 49 (4), 923 – 947, 2011

• F.-X. Meuwly, B. Ries, N. Zufferey, Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints, Algorithmic Operations Research 5 (2), 75 – 85, 2010
• M. Plumettaz, D. Schindl, N. Zufferey, Ant Local Search and its Efficient Adaptation to Graph Colouring, Journal of the Operational Research Society 61, 819 – 826, 2010
• M. Bierlaire, M. Thémans, N. Zufferey, A Heuristic for Nonlinear Global Optimization, INFORMS Journal on Computing 22 (1), 59 – 70, 2010

• A. Hertz, D. Schindl, N. Zufferey, A Solution Method for a Car Fleet Management Problem with Maintenance Constraints, Journal of Heuristics 15 (5), 425 – 450, 2009

• S. Varone, N. Zufferey, Three tabu search methods for the MI-FAP applied to 802.11 networks, RAIRO – Operations Research 42, 501 – 514, 2008

• N. Zufferey, P. Amstutz, P. Giaccari, Graph Colouring Approaches for a Satellite Range Scheduling Problem, Journal of Scheduling 11 (4), 263 – 277, 2008

• A. Hertz, M. Plumettaz, N. Zufferey, Variable Space Search for Graph Coloring, Discrete Applied Mathematics 156 (13), 2551 – 2560, 2008

• I. Bloechliger, N. Zufferey, A Graph Coloring Heuristic using Partial Solutions and a Reactive Tabu Scheme, Computers & Operations Research 35, 960 – 975, 2008

• P. Galinier, A. Hertz, N. Zufferey, An Adaptive Memory Algorithm for the Graph Coloring Problem, Discrete Applied Mathematics 156 (2), 267 – 279, 2008

• L. Luyet, S. Varone, N. Zufferey, An Ant Algorithm for the Steiner Tree Problem in Graphs, Lecture Notes in Computer Science 4448, 42 – 51, M. Giacobini et al. (Eds.): EvoWorkshops, 2007

• E. A. Silver, N. Zufferey, Inventory Control of Raw Material under Stochastic and Seasonal Lead Times, International Journal of Production Research 43 (24), 5161 – 5179, 2005

• A. Hertz, D. Schindl, N. Zufferey, Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints, 4OR 3 (2), 139 – 161, 2005

• C. Avanthay, A. Hertz, N. Zufferey, A Variable Neighborhood Search for Graph Coloring, European Journal of Operational Research 151, 379 – 388, 2003

Chapter of books

• A. Hertz, N. Zufferey, Vertex coloring using ant colonies, Chapter in Artificial Ants (Eds N. Monmarché, F. Guinand, P. Siarry), Iste & Wiley, France, 2010 (October), ISBN: 978-1-8482-1194-0

• A. Hertz, N. Zufferey, La coloration des sommets d’un graphe par colonies de fourmis, Chapter 11 (pp 261 – 279) in Fourmis Artificielles – Tome 1, Des bases algorithmiques aux réalisations avancées (Eds N. Monmarché, F. Guinand, P. Siarry), Hermès-Lavoisier, France, 2009 (October), ISBN: 978-2-7462-2119-2

In conference proceedings with review process

• N. Zufferey, F. Glover, A Reconstructive Evolutionary Metaheuristic for the Vertex Coloring Problem, Proceedings of the 23^rd Benelux Conference on Artificial Intelligence, BNAIC 2011, Gent, Belgium, November 3 – 4, 2011.

• D. Schindl, N. Zufferey, A local search for refueling locomotives, Proceedings of the 54^th annual conference of the Administrative Science Association of Canada, Production & Operations Management Division, ASAC 2011, 53 – 61, Montreal, Canada, July 2 – 5, 2011

• N. Zufferey, O. Labarthe, D. Schindl, Tabu search for a project scheduling problem with incompatibility and assignment costs, Proceedings of the 12^th International Workshop on Project Management and Scheduling, PMS 2010, 391 – 395, Tours, France, April 26 – 28, 2010

• A. Hertz, N. Zufferey, A New Ant Colony Algorithm Graph Coloring, Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization, NICSO 2006, 51 – 60, Granada, Spain, June 29 – 30, 2006

• N. Zufferey, M. Studer, E. A. Silver, Tabu Search for a Car Sequencing Problem, Proceedings of the 19^th International Florida Artificial Intelligence Research Society Conference, 457 – 462, FLAIRS 2006, Melbourne, USA, May 11 – 13, 2006

• P. Galinier, A. Hertz, N. Zufferey, Adaptive Memory Algorithms for Graph Coloring, Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, In D. S. Johnson, A. Mehrotra, M. Trick (eds), 75 – 82, COLOR 2002, Ithaca, USA, September 2002