The university timetabling problem - complexity and an integer linear programming formulation : a case study of UP FAMNIT

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	The university timetabling problem - complexity and an integer linear programming formulation : a case study of UP FAMNIT
Authors:	ID Pivač, Nevena (Author) ID Milanič, Martin (Mentor) More about this mentor... ID Vičič, Jernej (Co-mentor)
Files:	http://www.famnit.upr.si/sl/izobrazevanje/zakljucna_dela/view/589 http://www.famnit.upr.si/sl/izobrazevanje/zakljucna_dela/view/589
Language:	English
Work type:	Master's thesis/paper
Typology:	2.09 - Master's Thesis
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:	university timetabling, NP-completeness, integer linear programming, mathematical modelling
Place of publishing:	Koper
Place of performance:	Koper
Publisher:	[N. Mitrović]
Year of publishing:	2017
Year of performance:	2017
Number of pages:	IX, 71 str.
PID:	20.500.12556/RUP-8715
UDC:	519.8(043.2)
COBISS.SI-ID:	1539731652
Publication date in RUP:	09.11.2017
Views:	2383
Downloads:	54
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Language:	English
Title:	Problem urnika na univerzi - računska zahtevnost in formulacija s celoštevilskim linearnim programom: študija primera UP FAMNIT
Keywords:	problem urnika na univerzi, matematično modeliranje, NP-polnost, celoštevilsko linearno programiranje

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back