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

A note to independent sets in scheduling

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

zbMath0840.90090MaRDI QIDQ1907210

Ján Černý

Publication date: 4 July 1996

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/32924


zbMATH Keywords

crew schedulingbus-journey graphscontracting graphexpanding graphtotal service time of crews


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35)





Cites Work

  • A branch and bound algorithm for the multiple depot vehicle scheduling problem




This page was built for publication: A note to independent sets in scheduling

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