Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints

DOI10.1007/978-3-030-25005-8_30OpenAlexW2956840665MaRDI QIDQ2301756

Fumito Miyake, Kohei Hatano, Eiji Takimoto

Publication date: 25 February 2020

Full work available at URL: http://hdl.handle.net/2324/4495596

zbMATH Keywords

combinatorial optimizationprecedence constraintsjob schedulingMDD

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints