Multiprocessor scheduling under precedence constraints: Polyhedral results

Guardado en:

Detalles Bibliográficos
Publicado:	2006
Materias:	Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n5SPECISS_p770_Coll http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n5SPECISS_p770_Coll
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_0166218X_v154_n5SPECISS_p770_Coll
record_format	dspace
spelling	paper:paper_0166218X_v154_n5SPECISS_p770_Coll2023-06-08T15:15:26Z Multiprocessor scheduling under precedence constraints: Polyhedral results Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory Order polytopes Polyhedral combinatorics Valid inequalities Scheduling 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n5SPECISS_p770_Coll http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n5SPECISS_p770_Coll
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory Order polytopes Polyhedral combinatorics Valid inequalities Scheduling
spellingShingle	Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory Order polytopes Polyhedral combinatorics Valid inequalities Scheduling Multiprocessor scheduling under precedence constraints: Polyhedral results
topic_facet	Multiprocessors Order polytopes Polyhedral combinatorics Precedence constraints Scheduling Valid inequalities Combinatorial mathematics Integer programming Problem solving Set theory Order polytopes Polyhedral combinatorics Valid inequalities Scheduling
title	Multiprocessor scheduling under precedence constraints: Polyhedral results
title_short	Multiprocessor scheduling under precedence constraints: Polyhedral results
title_full	Multiprocessor scheduling under precedence constraints: Polyhedral results
title_fullStr	Multiprocessor scheduling under precedence constraints: Polyhedral results
title_full_unstemmed	Multiprocessor scheduling under precedence constraints: Polyhedral results
title_sort	multiprocessor scheduling under precedence constraints: polyhedral results
publishDate	2006
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v154_n5SPECISS_p770_Coll http://hdl.handle.net/20.500.12110/paper_0166218X_v154_n5SPECISS_p770_Coll
_version_	1768545779461390336