A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342): Difference between revisions

@@ Property / DOI @@
-.1007/s10951-015-0424-2
@@ Property / DOI: 10.1007/s10951-015-0424-2 / rank @@
-Normal rank
@@ Property / author @@
+M. Dambrine
@@ Property / author: M. Dambrine / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6625286
@@ Property / zbMATH DE Number: 6625286 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+educational timetabling
@@ Property / zbMATH Keywords: educational timetabling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+student scheduling
@@ Property / zbMATH Keywords: student scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity analysis
@@ Property / zbMATH Keywords: complexity analysis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-015-0424-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1964930428
@@ Property / OpenAlex ID: W1964930428 / rank @@
+Normal rank
@@ Property / cites work @@
+Assigning students to course sections using tabu search
+Normal rank
@@ Property / cites work @@
+Bipartite Edge Coloring in $O(\Delta m)$ Time
@@ Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank @@
+Normal rank
@@ Property / cites work @@
+A large scale timetabling problem
@@ Property / cites work: A large scale timetabling problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2779802
@@ Property / cites work: Q2779802 / rank @@
+Normal rank
@@ Property / cites work @@
+When Is the Classroom Assignment Problem Hard?
@@ Property / cites work: When Is the Classroom Assignment Problem Hard? / rank @@
+Normal rank
@@ Property / cites work @@
+On Edge Coloring Bipartite Graphs
@@ Property / cites work: On Edge Coloring Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+An introduction to timetabling
@@ Property / cites work: An introduction to timetabling / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity analysis and an algorithmic approach to student sectioning in existing timetables
+Normal rank
@@ Property / cites work @@
+Timetable construction: the algorithms and complexity perspective
+Normal rank
@@ Property / cites work @@
+Q5518886
@@ Property / cites work: Q5518886 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2779799
@@ Property / cites work: Q2779799 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10951-015-0424-2
@@ Property / DOI: 10.1007/S10951-015-0424-2 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:310342