most citedA hybrid ACO approach to the Matrix Bandwidth Minimization Problem

13 citations · 34 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CY201211 cited

Classical hybrid approaches on a transportation problem with gas emissions constraints

Camelia-M. Pintea, Petrica C. Pop, Mara Hajdu-Macelaru

In order to keep a green planet, in particular its important to limiting the pollution with gas emissions. In a specific capacitated fixed-charge transportation problem with fixed…

cs.MA20129 cited

Sensor networks security based on sensitive robots agents. A conceptual model

Camelia-M. Pintea, Petrica C. Pop

Multi-agent systems are currently applied to solve complex problems. The security of networks is an eloquent example of a complex and difficult problem. A new model-concept Hybrid…

cs.AI201213 cited

A hybrid ACO approach to the Matrix Bandwidth Minimization Problem

Camelia-M. Pintea, Camelia Chira, Gloria-C. Crisan

The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matri…

cs.AI20121 cited

Distributed Pharaoh System for Network Routing

Camelia-M. Pintea, D. Dumitrescu

In this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is base…

cs.AI2012

New results of ant algorithms for the Linear Ordering Problem

Camelia-M. Pintea, Camelia Chira, D. Dumitrescu

Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instance…