Back to Results
First PageMeta Content
Complexity classes / School timetable / P-complete / NP-hard / Graph coloring / NP / Combinatorial optimization / PP / Assignment problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Untitled
Add to Reading List

Document Date: 2002-05-14 04:13:37

Open Document

File Size: 2,22 MB

Share Result on Facebook

City

Eindhoven / Kingston / /

Country

Netherlands / /

IndustryTerm

polynomial algorithm / tabu search routine / feasible complete solutions / tree search / polynomial-time algorithms / travel time constraints / student groups / feasible solution / tree search algorithm / tabu search algorithm / student / nd solutions / subject groups / polynomial-time algorithm / integer programming software / search problem / electricity sockets / software packages / search algorithm / sufficient travel time / polynomialtime algorithm / feasible solutions / /

Person

E.H.L. Aarts / Johannes Willemen / Van Kesteren / R.A. van Santen / Alvarez-Valdes / C LASS / J.K. Lenstra Copromotor / Roy Willemen / Paul Verspaget Printed / /

PublishedMedium

the Lecture Notes in Computer Science / /

Technology

SMS / aV / Universiteitsdrukkerij Technische Universiteit Eindhoven School timetable construction Algorithms / polynomial-time algorithms / polynomial-time algorithm / no polynomial-time algorithm / 5.4 Tree search algorithm / polynomialtime algorithm / tabu search algorithm / School timetable construction Algorithms / decision support system / tree search algorithm / polynomial algorithm / /

SocialTag