A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop
The goal of Machine Learning to automatically learn from data, extract knowledge and to
make decisions without any human intervention. Such automatic (aML) approaches show …
make decisions without any human intervention. Such automatic (aML) approaches show …
Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review
Computational and storage costs of resolution of large sparse linear systems Ax= b can be
performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out …
performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out …
[كتاب][B] Advances in bio-inspired computing for combinatorial optimization problems
CM Pintea - 2014 - Springer
” Advances in Bio-inspired Combinatorial Optimization Problems” illustrates several recent
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
bio-inspired efficient algorithms for solving NP-hard problems. Theoretical bio-inspired …
Emergency management using geographic information systems: application to the first romanian traveling salesman problem instance
The strategic design of logistic networks, such as roads, railways or mobile phone networks,
is essential for efficiently managing emergency situations. The geographic coordinate …
is essential for efficiently managing emergency situations. The geographic coordinate …
An ant colony hyperheuristic approach for matrix bandwidth reduction
This paper considers the bandwidth reduction problem for large-scale matrices in serial
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
An evaluation of heuristic methods for the bandwidth reduction of large-scale graphs
This paper studies the bandwidth reduction problem for large-scale sparse matrices in serial
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
computations. A heuristic for bandwidth reduction reorders the rows and columns of a given …
Iterated Local Search with Tabu Search for the Bandwidth Reduction Problem in Graphs
This paper addresses the bandwidth reduction problem in graphs, which is relevant in
several applications, such as reducing memory consumption and computational cost in …
several applications, such as reducing memory consumption and computational cost in …
Innovative platform for designing hybrid collaborative & context-aware data mining scenarios
The process of knowledge discovery involves nowadays a major number of techniques.
Context-Aware Data Mining (CADM) and Collaborative Data Mining (CDM) are some of the …
Context-Aware Data Mining (CADM) and Collaborative Data Mining (CDM) are some of the …
A hybrid classical approach to a fixed-charged transportation problem
Some of the most complex problems, nowadays, are transportation problems. A capacitated
fixed-charge transportation problem is the problem we are trying to solve using hybrid …
fixed-charge transportation problem is the problem we are trying to solve using hybrid …
Secure traveling salesman problem with intelligent transport systems features
Meeting the security requests in transportation is nowadays a must. The intelligent transport
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …
systems (ITSs) represent the support for addressing such a challenge, due to their ability to …