Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Manoel B. Campêlo"'
Publikováno v:
Discrete Applied Mathematics. 323:134-148
Given an undirected connected graph G = ( V , E ) , the minimum linear arrangement problem (MinLA) consists in determining a permutation π ≔ ( π 1 , … , π n ) of the node-set V = { 1 , … , n } , which minimizes the sum of edge costs | π i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd71b43c2e2b0fc213dc810264f81411
https://doi.org/10.1016/j.dam.2021.06.021
https://doi.org/10.1016/j.dam.2021.06.021
Autor:
Manoel B. Campêlo, Daniel Severín
Publikováno v:
Discrete Applied Mathematics. 301:26-48
A legal dominating sequence of a graph is an ordered dominating set of vertices where each element dominates at least another one not dominated by its predecessors in the sequence. The length of a largest legal dominating sequence is called Grundy do
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61ccd9a0fecc701c28eba362ad4eb977
https://doi.org/10.1016/j.dam.2021.05.025
https://doi.org/10.1016/j.dam.2021.05.025
Publikováno v:
Annals of Operations Research. 316:1267-1278
Consider an arc-capacitated network $$\mathcal {N}$$ through which an integer-valued flow must be sent from several source nodes to a sink node. Each feasible flow defines a corresponding multigraph with the same vertices as $$\mathcal {N}$$ and an e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6580e2a7fefa2805b04c63656ca685e5
https://doi.org/10.1007/s10479-021-04180-3
https://doi.org/10.1007/s10479-021-04180-3
Publikováno v:
Optimization Letters. 15:2879-2895
We apply the t-linearization technique to the maximum diversity problem (MDP) and compare its performance with other well-known linearizations. We lift the t-constraints based on the cardinality restriction, derive valid inequalities for MDP, and sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58915def83b89460a07cfb5084ee7949
https://doi.org/10.1007/s11590-021-01719-y
https://doi.org/10.1007/s11590-021-01719-y
Publikováno v:
International Transactions in Operational Research. 28:3147-3171
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9b67488bd3a0ef997d2db0fecc54d91
https://doi.org/10.1111/itor.12706
https://doi.org/10.1111/itor.12706
Publikováno v:
LAGOS
We introduce the Generalized Dependency Constrained Spanning Tree Problem (G-DCST), where an edge can be chosen only if the number of edges chosen from its dependency set lies in a certain interval. The dependency relations between the edges of the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::549ceb4fa4770607c3732ee782e2e3d7
https://doi.org/10.1016/j.entcs.2019.08.062
https://doi.org/10.1016/j.entcs.2019.08.062
Publikováno v:
International Transactions in Operational Research. 27:867-898
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc1c9b9e85ba5a64b9d63eff4966929f
https://doi.org/10.1111/itor.12690
https://doi.org/10.1111/itor.12690
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2021, 42 (1), pp.125-150. ⟨10.1007/s10878-021-00740-2⟩
Journal of Combinatorial Optimization, Springer Verlag, 2021, 42 (1), pp.125-150. ⟨10.1007/s10878-021-00740-2⟩
Given a graph $G$ and a digraph $D$ whose vertices are the edges of $G$, we investigate the problem of finding a spanning tree of $G$ that satisfies the constraints imposed by $D$. The restrictions to add an edge in the tree depend on its neighborhoo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::364e43be75eb75fcc2195b25f1de7d25
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374555/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374555/document
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC 2020).
Consideramos o problema da Floresta Geradora k-Rotulada, que consiste em encontrar uma floresta geradora de um grafo colorido em arestas com a menor quantidade de árvores e no máximo k cores. Derivamos duas caracterizações para o problema e mostr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39456ea34a15eee63a9fd55d6f1fe9cd
https://doi.org/10.5753/etc.2020.11092
https://doi.org/10.5753/etc.2020.11092
Publikováno v:
Annals of Operations Research. 286:201-216
Based on the sociometric analysis of social networks, we introduce the sociotechnical teams formation problem (STFP). Given a group of individuals with different skill-sets and a social network that captures the mutual affinity between them, the prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54f56a193fe81249c2437c9f221e33ad
https://doi.org/10.1007/s10479-018-2759-5
https://doi.org/10.1007/s10479-018-2759-5