Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mario Leston-Rey"'
Autor:
Orlando Lee, Mario Leston-Rey
Publikováno v:
Mathematical Programming. 159:31-80
In this paper, we consider integral (and fractional) packing problems in generalized kernel systems with a mixed family (gksmf). This framework generalizes combinatorial packing problems of several structures as, for instance, st-flows, arborescences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe51007be5e5d18b5d73ddeb8ed41171
https://doi.org/10.1007/s10107-015-0948-4
https://doi.org/10.1007/s10107-015-0948-4
Autor:
Mario Leston-Rey
Publikováno v:
Journal of Combinatorial Optimization. 31:506-514
We prove that an algorithm of Schrijver, that computes an integral packing of branchings in a capacitaded digraph, produces a packing with no more than $$m + r - 1$$m+r-1 different branchings, where $$m$$m is the number of arcs, and $$r$$r the number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::931cf34e350881c279e1333ac33a5577
https://doi.org/10.1007/s10878-014-9768-3
https://doi.org/10.1007/s10878-014-9768-3
Autor:
Mario Leston-Rey, Yoshiko Wakabayashi
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
We study a framework, which we call a generalized kernel system, introduced by Frank. We prove some integral and fractional packing theorems in this framework which, in particular, imply an improvement over the best known upper bounds on the size of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68275e61c6263d92e4e2f10616eaee76
https://doi.org/10.1007/s10107-014-0746-4
https://doi.org/10.1007/s10107-014-0746-4
Autor:
Orlando Lee, Mario Leston-Rey
We consider the problem of finding an integral packing of branchings in a capacitated digraph with root-set demands. Schrijver described an algorithm that returns a packing with at most m+n^3+r branchings that makes at most m(m+n^3+r) calls to an ora
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e3336ed320a3783f9ff13cc5dfd101d
http://arxiv.org/abs/1306.3480
http://arxiv.org/abs/1306.3480
Autor:
Mario Leston Rey
Publikováno v:
Biblioteca Digital de Teses e Dissertações da USP
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
O problema da determinação de uma T-junção mínima e os desdobramentos desse problema constituem o assunto central desta dissertação. Determinar uma T-junção mínima é equivalente a decidir se um grafo com pesos mais ou menos 1 nas arestas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41cccbc409e9acc9ee58dbd8c7788e11