Netto Paulo Oswaldo Boaventura

Paulo Oswaldo Boaventura Netto

Information about the author Paulo Oswaldo Boaventura Netto will soon be added to the site.
Found 4 papers in total
A survey for the quadratic assignment problem
A survey for the quadratic assignment problem
2007
The quadratic assignment problem (QAP), one of the most difficult problems in the...
Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
2003
This work discusses the use of a neighbouring structure in the design of specific...
A discussed review of the approaches of the quadratic assignment problem
A discussed review of the approaches of the quadratic assignment problem
2004
The Quadratic Assignment Problem, QAP, one of the most difficult problems in NP-hard...
A structural way for the study of Hamiltonian problems
A structural way for the study of Hamiltonian problems
1995
A vertex-set partition in an undirected graph is defined in a way that information...
Papers per page: