An enhanced timetabling procedure for the no-wait job shop problem : a complete local search approachFRAMINAN, Jose M; SCHUSTER, Christoph.Computers & operations research. 2006, Vol 33, Num 5, pp 1200-1213, issn 0305-0548, 14 p.Article

Local search for planning and scheduling (Berlin, 21 August 2001, revised papers)Nareyek, Alexander.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42898-4, VI, 169 p, isbn 3-540-42898-4Conference Proceedings

Board-laying techniques improve local search in mixed planning and schedulingKNIGHT, Russell; RABIDEAU, Gregg; CHIEN, Steve et al.Lecture notes in computer science. 2001, pp 95-107, issn 0302-9743, isbn 3-540-42898-4Conference Paper

Planning with derived predicates through rule-action graphs and local search techniquesGEREVINI, Alfonso; SAETTI, Alessandro; SERINA, Ivan et al.Lecture notes in computer science. 2005, pp 177-181, issn 0302-9743, isbn 3-540-29041-9, 5 p.Conference Paper

Combining Local search and Constraint propagation to find a minimal change solution for a Dynamic CSPROOS, Nico; YONGPING RAN; VAN DEN HERIK, Jaap et al.Lecture notes in computer science. 2000, pp 272-282, issn 0302-9743, isbn 3-540-41044-9Conference Paper

Travelling in the world of local searches in the space of partial assignmentsPRALET, Cédric; VERFAILLIE, Gérard.Lecture notes in computer science. 2004, pp 240-255, issn 0302-9743, isbn 3-540-21836-X, 16 p.Conference Paper

A local search algorithm for balanced incomplete block designsPRESTWICH, Steven.Lecture notes in computer science. 2003, pp 132-143, issn 0302-9743, isbn 3-540-00986-8, 12 p.Conference Paper

Multiple optima in local searchRODL, V; TOVEY, C.Journal of algorithms (Print). 1987, Vol 8, Num 2, pp 250-259, issn 0196-6774Article

Block Motion Estimation Using Modified Two-Bit TransformDEMIR, Begum; ERTÜRK, Sarp.Lecture notes in computer science. 2006, pp 522-531, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Boosting local search with artificial antsSOLNON, Christine.Lecture notes in computer science. 2001, pp 620-624, issn 0302-9743, isbn 3-540-42863-1Conference Paper

Local search for the maximum parsimony problemGOËFFON, Adrien; RICHER, Jean-Michel; HAO, Jin-Kao et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 678-683Conference Paper

Iterated local search for the quadratic assignment problemSTÜTZLE, Thomas.European journal of operational research. 2006, Vol 174, Num 3, pp 1519-1539, issn 0377-2217, 21 p.Article

Bounds for the single source modular capacitated plant location problemCORREIA, Isabel; CAPTIVO, Maria Eugenia.Computers & operations research. 2006, Vol 33, Num 10, pp 2991-3003, issn 0305-0548, 13 p.Article

Characterizing diversity in genetic programmingWYNS, Bart; DE BRUYNE, Peter; BOULLART, Luc et al.Lecture notes in computer science. 2006, pp 250-259, issn 0302-9743, isbn 3-540-33143-3, 1Vol, 10 p.Conference Paper

Variable Neighborhood Search for the Orienteering ProblemSEVKLI, Zülal; SEVILGEN, F. Erdogan.Lecture notes in computer science. 2006, pp 134-143, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Principles and practice of constraint programmingROSSI, Francesca.Constraints (Dordrecht). 2005, Vol 10, Num 2, issn 1383-7133, 90 p.Conference Proceedings

Pushing constraints to detect local patternsBONCHI, Francesco; GIANNOTTI, Fosca.Lecture notes in computer science. 2005, pp 1-19, issn 0302-9743, isbn 3-540-26543-0, 19 p.Conference Paper

On confidence intervals for the number of local optimaEREMEEV, Anton V; REEVES, Colin R.Lecture notes in computer science. 2003, pp 224-235, issn 0302-9743, isbn 3-540-00976-0, 12 p.Conference Paper

Incremental local search for planning problemsONAINDIA, Eva; SEBASTIA, Laura; MARZAL, Eliseo et al.Lecture notes in computer science. 2001, pp 139-157, issn 0302-9743, isbn 3-540-42898-4Conference Paper

Local search for unsatisfiabilityPRESTWICH, Steven; LYNCE, Ines.Lecture notes in computer science. 2006, pp 283-296, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

Principles and practice of constraint programming (CP 2004)WALLACE, Mark.Constraints (Dordrecht). 2005, Vol 10, Num 4, issn 1383-7133, 112 p.Conference Proceedings

SAT, local search dynamics and density of statesBELAIDOUNI, Mériéma; HAO, Jin-Kao.Lecture notes in computer science. 2002, pp 192-204, issn 0302-9743, isbn 3-540-43544-1Conference Paper

Using failed local search for SAT as an oracle for tackling harder A.I. problems more efficientlyGREGOIRE, Eric; MAZURE, Bertrand; SAÏS, Lakhdar et al.Lecture notes in computer science. 2002, pp 51-60, issn 0302-9743, isbn 3-540-44127-1, 10 p.Conference Paper

Local search techniques for the generalized resource constrained project scheduling problemSAMPSON, S. E; WEISS, E. N.Naval research logistics. 1993, Vol 40, Num 5, pp 665-675, issn 0894-069XArticle

2-Change for k-connected networksGOEMANS, M. X; TALLURI, K. T.Operations research letters. 1991, Vol 10, Num 2, pp 113-117, issn 0167-6377Article