Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A graph formulation of a school scheduling algorithm

From MaRDI portal
Publication:4045868
Jump to:navigation, search

DOI10.1145/361604.361625zbMath0293.90025OpenAlexW1970226050MaRDI QIDQ4045868

No author found.

Publication date: 1974

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361604.361625



Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial aspects of matroids and geometric lattices (05B35)


Related Items (2)

An existential problem of a weight-controlled subset and its application to school timetable construction ⋮ Colouring, constraint satisfaction, and complexity




This page was built for publication: A graph formulation of a school scheduling algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4045868&oldid=17771700"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 03:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki