<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>The university timetabling problem - complexity and an integer linear programming formulation</dc:title><dc:creator>Pivač,	Nevena	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Mentor)
	</dc:creator><dc:creator>Vičič,	Jernej	(Komentor)
	</dc:creator><dc:subject>university timetabling</dc:subject><dc:subject>NP-completeness</dc:subject><dc:subject>integer linear programming</dc:subject><dc:subject>mathematical modelling</dc:subject><dc:publisher>[N. Mitrović]</dc:publisher><dc:date>2017</dc:date><dc:date>2017-11-09 12:05:48</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>8715</dc:identifier><dc:identifier>UDK: 519.8(043.2)</dc:identifier><dc:identifier>COBISS.SI-ID: 1539731652</dc:identifier><dc:language>sl</dc:language></metadata>
