Navegar

Colección

Datos Estadísticas

Lista de

Polyhedral combinatorics
6
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):64-78
"Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):64-78
"On the combinatorial structure of chromatic scheduling polytopes" (2006) Marenco, J.; Wagler, A. Discrete Applied Mathematics. 154(13 SPEC ISS):1865-1876
"On the combinatorial structure of chromatic scheduling polytopes" (2006) Marenco, J.; Wagler, A. Discrete Applied Mathematics. 154(13 SPEC ISS):1865-1876