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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On the complexity of a periodic scheduling problem with precedence relations

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

DOI10.1007/978-3-030-64843-5_8OpenAlexW3110828165MaRDI QIDQ2692207

Richard Hladík, Anna Minaeva, Zdeněk Hanzálek

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_8



Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)








This page was built for publication: On the complexity of a periodic scheduling problem with precedence relations

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