# Journal of Combinatorial Optimization

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 224-253

*distinct*; otherwise the machines are said to be

*similar*. Each job $$j \in J$$ j ∈ J is characterized by a length $$p_j$$ p j , and an arrival time $$t_j$$ t j ; the question is to determine whether there exists a...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 130-149

*D*is an efficient closed domination digraph if there exists a subset

*S*of

*V*(

*D*) for which the closed out-neighborhoods centered in vertices of

*S*form a partition of

*V*(

*D*). In this work we deal with efficient closed domination digraphs among several product of digraphs. We completely describe the efficient closed domination digraphs among lexicographic and strong products of digraphs. We characterize...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 254-267

*k*-Canadian Traveler Problem (

*k*-CTP) which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agent is initially at O. There are

*k*blocked edges in the graph, but these edges are not known to the agent. A blocked edge is learned when the agent arrives at one of its end-nodes. The goal of the...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 268-277

*G*, where

*G*is called the underlying graph of $$G^\sigma $$ G σ . Let $$S(G^\sigma )$$ S ( G σ ) denote the skew-adjacency matrix of $$G^\sigma $$ G σ and $$\alpha (G)$$ α ( G ) be the independence number of

*G*. The rank of $$S(G^\sigma )$$ S ( G...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 208-223

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 197-207

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 111-129

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 72-85

*P*between two given nodes and the Attacker chooses a network element

*a*(that is,...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 292-315

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 316-332

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 278-291

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 21-49

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 1-20

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 86-110

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 185-196

*k*-coloring $$\phi :V(G)\cup E(G)\rightarrow \{1,2,\ldots ,k\}$$ ϕ : V ( G ) ∪ E ( G ) → { 1 , 2 , … , k } is called adjacent vertex distinguishing if $$C_{\phi }(u)\ne C_{\phi }(v)$$ C ϕ ( u ) ≠ C ϕ ( v ) for each edge $$uv\in E(G)$$ u v ∈ E ( G ) , where $$C_{\phi }(u)$$ C ϕ ( u ) is the set of the color of

*u*and the colors of all edges...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 150-164

*V*. The problem is called 3-path partition, and it has close relationships to the well-known path cover problem and the set cover problem. The general

*k*-path partition problem for a constant $$k \ge 3$$ k ≥ 3 is NP-hard, and it...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 165-184

*n*-vertex non-negatively real-weighted graph

*G*, whose vertices are partitioned into a set of

*k*clusters, a

*clustered network design problem*on

*G*consists of solving a given network design optimization problem on

*G*, subject to some additional constraints on its clusters. In particular, we focus on the classic problem of designing a

*single-source shortest-path tree*, and we analyse its computational...

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 50-71