During the end-of-life (EOL) product recovery process, there are a series of combinatorial optimization problems (COPs) that should be efficiently solved. These COPs generally result from reverse logistics (RL) and remanufacturing, such as facility location vehicle routing in RL, scheduling, planning, line balancing remanufacturing. Each RL remanufacturing has been reviewed; however, no review ...

Combinatorial optimization problems (COPs) are a class of NP-hard with great practical significance. Traditional approaches for COPs suffer from high computational time and reliance on expert knowledge, machine learning (ML) methods, as powerful tools have been used to overcome these problems. In this review, the in energy areas series modern ML approaches, i.e., interdisciplinary COPs, areas, ...

The ‘Cheating Robot’ version of Cops and Robbers is played on a finite, simple, connected graph. players move in the same time period. However, before moving, robot observes to which vertices cops are moving it fast enough complete its also know that will use this information. More required capture than robber. Indeed, minimum degree lower bound number robot. Only tree one cop guaranteed robot,...

The cop throttling number $th_c(G)$ of a graph $G$ for the game Cops and Robbers is minimum $k + capt_k(G)$, where $k$ cops $capt_k(G)$ rounds needed to capture robber on over all possible games in which both players play optimally. In this paper, we construct family graphs having $th_c(G)= \Omega(n^{2/3})$, establish sublinear upper bound number, show that chordal $O(\sqrt{n})$. We also introd...

The purpose of the current research is to provide a performance appraisal system capable of considering the value chain network structure of research and development (R&D) projects for Complex products and systems (CoPS) under uncertainty of data. Therefore, in order to achieve this goal, a network data envelopment analysis (NDEA) approach and the possibilistic programming to provide a new fuzz...

CoPS is an automatic checker of multilevel system security properties. CoPS can be used to check three different bisimulation-based non-interference properties for systems expressed as terms of the Security Process Algebra (SPA) language. The considered properties are persistent, in the sense that they are preserved at each execution step. Moreover, they imply the Bisimulation-based Non Deducib...

The COPS protocol has been designed to enable communication on the interface between the policy decision administrator and the policy enforcement devices in a policy-based networking environment. It can be recognized that on the same interface there is the need to transfer information related to the request of resource by QoS clients and for the allocation of resources by resource allocation se...

We study the vertex pursuit game of Cops and Robbers, in which cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. We focus on Gd(n, r), a random geometric graph in which n vertices are chosen uniformly at random and independently from [0, 1], and two vertices are adjacent if the Euclidean distan...