Zobrazeno 1 - 10
of 175
pro vyhledávání: '"A. Ridha Mahjoub"'
Autor:
Ridha Mahjoub
Publikováno v:
Lecture Notes in Mechanical Engineering ISBN: 9783031146145
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50fad7306c3c3ffc9c82f8d9820f2c7d
https://doi.org/10.1007/978-3-031-14615-2_1
https://doi.org/10.1007/978-3-031-14615-2_1
Publikováno v:
Discrete Applied Mathematics. 308:1-3
Publikováno v:
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT).
Publikováno v:
Annals of Operations Research. 298:1-5
Publikováno v:
Discrete Applied Mathematics. 290:86-111
We are given a graph G = ( V ∪ T , E ) , with V ∪ T the set of vertices where T is a set of terminals and E the set of edges. The multi-terminal vertex separator problem consists in finding a subset of vertices S ⊆ V of minimum size intersectin
Publikováno v:
In Theoretical Computer Science 16 March 2012 423:25-29
Publikováno v:
Soft Computing
Soft Computing, Springer Verlag, 2020, ⟨10.1007/s00500-020-05043-y⟩
Soft Computing, Springer Verlag, 2020, ⟨10.1007/s00500-020-05043-y⟩
We consider a variant of the Travelling Salesman Problem (TSP), the Multiple Steiner TSP with Order constraints (MSTSPO). Consider a weighted undirected graph and a set of salesmen, and each salesman is associated with a set of compulsory vertices to
Publikováno v:
In Computers & Industrial Engineering September 2011 61(2):422-429
Publikováno v:
Journal of Combinatorial Optimization. 37:418-422
Autor:
Hassene Aissi, A. Ridha Mahjoub
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
ISCO
We consider in this paper a generalization of the minimum \(s-t\) cut problem. Suppose we are given a directed graph \(G=(V,A)\) with two distinguished nodes s and t, k non-negative arcs cost functions \(c^1,\ldots ,c^k:A \rightarrow \mathbb {Z}_+\),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::624a6d07cdb657f3d259a5cbac9b5225
https://doi.org/10.1007/978-3-030-53262-8_7
https://doi.org/10.1007/978-3-030-53262-8_7