2005
DOI: 10.1007/978-3-540-30557-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Specializing Narrowing for Timetable Generation: A Case Study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…In assignment problems, the Hungarian algorithm changes the weights in a matrix to locate the optimal assignment. Eventually, a new matrix is obtained in which the optimal assignment is identified [67].…”
Section: Hungarian Algorithm (Ha)mentioning
confidence: 99%
“…In assignment problems, the Hungarian algorithm changes the weights in a matrix to locate the optimal assignment. Eventually, a new matrix is obtained in which the optimal assignment is identified [67].…”
Section: Hungarian Algorithm (Ha)mentioning
confidence: 99%