Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problema concepción horario")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 596

  • Page / 24
Export

Selection :

  • and

Practice and theory of automated timetabling V (5th international conference, PATAT 2004, Pittsburgh PA, USA, August 18-20, 2004)Burke, Edmund.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30705-2, 1Vol, XII-353 p, isbn 3-540-30705-2Conference Proceedings

A tiling algorithm for high school timetablingKINGSTON, Jeffrey H.Lecture notes in computer science. 2005, pp 208-225, issn 0302-9743, isbn 3-540-30705-2, 1Vol, 18 p.Conference Paper

Exam Timetabling Using Genetic AlgorithmCUPIC, Marko; GOLUB, Marin; JAKOBOVIC, Domagoj et al.Information technology interfaces. 2009, pp 357-362, isbn 978-953-7138-15-8, 1Vol, 6 p.Conference Paper

New algorithms for examination timetablingCARAMIA, Massimiliano; DELL'OLMO, Paolo; ITALIANO, Gluseppe F et al.Lecture notes in computer science. 2001, pp 230-241, issn 0302-9743, isbn 3-540-42512-8Conference Paper

Solving sudoku with the GAuGE systemNICOLAU, Miguel; RYAN, Conor.Lecture notes in computer science. 2006, pp 213-224, issn 0302-9743, isbn 3-540-33143-3, 1Vol, 12 p.Conference Paper

The university course timetabling problem with a three-phase approachKOSTUCH, Philipp.Lecture notes in computer science. 2005, pp 109-125, issn 0302-9743, isbn 3-540-30705-2, 1Vol, 17 p.Conference Paper

A combinatorial property of the maximum round robin tournament problemHORBACH, Andrei.Operations research letters. 2010, Vol 38, Num 2, pp 121-122, issn 0167-6377, 2 p.Article

A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problemPILLAY, N; BANZHAF, W.European journal of operational research. 2009, Vol 197, Num 2, pp 482-491, issn 0377-2217, 10 p.Article

A Lookup Table Model for Time-Memory Trade-Off Attacks on Binary Additive Stream CiphersERGULER, Imran; ANARIM, Emin.Lecture notes in computer science. 2006, pp 918-923, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 6 p.Conference Paper

A non-standard Genetic algorithm approach to solve constrained school timetabling problemsFERNANDEZ, Cristina; SANTOS, Matilde.Lecture notes in computer science. 2003, pp 26-37, issn 0302-9743, isbn 3-540-20221-8, 12 p.Conference Paper

PATAT 2000 : practice and theory of automated timetabling III (Konstanz, 16-18 August 2000, selected papers)Burke, Edmund; Erben, Wilhelm.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42421-0, XII, 357 p, isbn 3-540-42421-0Conference Proceedings

Some complexity aspects of secondary school timetabling problemsTEN EIKELDER, H. M. M; WILLEMEN, R. J.Lecture notes in computer science. 2001, pp 18-27, issn 0302-9743, isbn 3-540-42421-0Conference Paper

Use of negative examples in training the HVS semantic modelJURCICEK, Filip; SVEC, Jan; ZAHRADIL, Jiri et al.Lecture notes in computer science. 2006, pp 605-612, issn 0302-9743, isbn 3-540-39090-1, 1Vol, 8 p.Conference Paper

Characterizing feasible pattern sets with a minimum number of breaksMIYASHIRO, Ryuhei; IWASAKI, Hideya; MATSUI, Tomomi et al.Lecture notes in computer science. 2003, pp 78-99, issn 0302-9743, isbn 3-540-40699-9, 22 p.Conference Paper

Modelling timetabling problems with STTLKINGSTON, Jeffrey H.Lecture notes in computer science. 2001, pp 309-321, issn 0302-9743, isbn 3-540-42421-0Conference Paper

Constructing fair round robin tournaments with a minimum number of breaksVAN 'T HOF, Pim; POST, Gerhard; BRISKORN, Dirk et al.Operations research letters. 2010, Vol 38, Num 6, pp 592-596, issn 0167-6377, 5 p.Article

Case-based Reasoning in course timetabling : An attribute graph approachBURKE, Edmund K; MACCARTHY, Bart; PETROVIC, Sanja et al.Lecture notes in computer science. 2001, pp 90-104, issn 0302-9743, isbn 3-540-42358-3Conference Paper

Some applications of the clustered travelling salesman problemLAPORTE, G; PALEKAR, U.The Journal of the Operational Research Society. 2002, Vol 53, Num 9, pp 972-976, issn 0160-5682Article

Extended clique initialisation in examination timetablingCARTER, M. W; JOHNSON, D. G.The Journal of the Operational Research Society. 2001, Vol 52, Num 5, pp 538-544, issn 0160-5682Article

Resource-constrained project scheduling and timetablingBRUCKER, Peter; KNUST, Sigrid.Lecture notes in computer science. 2001, pp 277-293, issn 0302-9743, isbn 3-540-42421-0Conference Paper

Automated university timetabling : The state of the artBURKE, E; JACKSON, K; KINGSTON, J. H et al.Computer journal (Print). 1997, Vol 40, Num 9, pp 565-571, issn 0010-4620Article

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problemsDEFU ZHANG; YONGKAI LIU; M'HALLAH, Rym et al.European journal of operational research. 2010, Vol 203, Num 3, pp 550-558, issn 0377-2217, 9 p.Article

A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technologyKENDALL, Graham; NAIMAH MOHD HUSSIN.Lecture notes in computer science. 2005, pp 270-293, issn 0302-9743, isbn 3-540-30705-2, 1Vol, 24 p.Conference Paper

Scheduling a major college basketball conferenceNEMHAUSER, G. L; TRICK, M. A.Operations research. 1998, Vol 46, Num 1, pp 1-8, issn 0030-364XArticle

Application of constraint hierarchy to timetabling problemsYAKHNO, Tatyana; TEKIN, Evren.Lecture notes in computer science. 2002, pp 11-18, issn 0302-9743, isbn 3-540-00028-3, 8 p.Conference Paper

  • Page / 24