Biography
Nelson Maculan Filho, Brazilian industrial and computational engineer (Londrina, Paraná State 19 March 1943 –
Created algorithms for use in the field of combinatorial optimization
Proposed formulation for s-directed spanning tree
With Armin Claus and independently of J. Beasley & R. Wong proposed a reformulation of Steiner graph problem through a digraph obtained from a G graph
OTHER CONTRIBUTIONS/SOME BIBLIOGRAPHY
With C.T. Bornstein, M. Portugal & L. de Lima Pinto. Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization. Computers & Operations Research 39:1969-76, 2012.
With R. Q. Nascimento, A.F. Uzeda & L.A.F. Cabral. A Model to the Ellipsoidal Filling Problem. Vietnam Journal of Mathematics, 40:345-54, 2012.
With Y.A. Frota, T.F. Noronha & C.C. Ribeiro. A branch-and-cut algorithm for partition coloring. Networks (New York, N.Y. Print) 55:437-44, 2010.
With J.A.M. Brito, M. Lila & F.M.T. Montenegro. An exact algorithm for the stratification problem with proportional allocation. Optimization Letters 4:185-95, 2010.
With D. Mauricio & L. Rivera. An efficient FFD method to solve the one-dimensional stock cutting problem. GESTS International Transactions on Computer Science and Engineering 61:25-36, 2010.
With A.S. Cunha, A.P. Lucena Filho & M.G.C. Resende. A Relax-and-Cut Algorithm for the Prize-Collecting Steiner Problem in Graphs. Discrete Applied Mathematics 157: 1198-17, 2009.
With M. S. Ibrahim & M. Minoux, A strong flow-based formulation for the shortest path problem in digraphs with negative cycles, International Transactions in Operational Research (ITOR) 16:361–9, 2009.
With L.S.B.S. Leite, Y.A.Frota, T.F. Noronha & C. C. Ribeiro, A branch-and-cut algorithm for equitable coloring based on a formulation by representatives. Electronic Notes in Discrete Mathematics 35: 347-52, 2009
With E. Amaldi, L. Liberti & F. Maffioli. Edge-swapping algorithm for the minimum fundamental cycle basis problem, Mathematical Methods of Operations Research 69: 205–3, 2009
With M. Drazic, C.C. Lavor & N. Mladenovic, A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule, EJOR (European Journal of Operational Research), 185 (3):1265-73, 2008
With L. Liberti & C. C. Lavor. A branch-and-prune algorithm for the molecular distance geometry problem, International Transactions in Operational Research (ITOR), 15:1-17, 2008
With E.F.G. Goldbarg & M.C. Goldbarg. A new neighborhood for the QAP. Electronic Notes in Discrete Mathematics 30:3-6, 2008.
With S. Kucherenko, P. Belotti & L. Liberti. New formulations for the kissing number problem. Discrete Applied Mathematics 155(14): 1793-1894, 2007
With E.M. Macambira & C. C. de Souza, A column generation approach for SONET ring assignment. NETWORKS 47 (3):157-71, 2006
With C.C. Lavor. A function to test methods applied to global minimization of potential energy of molecules. Numerical Algorithm 35(2-4):287-300, 2004
With C. Prata Santiago, E.M. Macambira & M.H.C. Jardim, An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn. Journal of Optimization Theory and Applications (JOTA), 117(3):553-74, 2003
With R. Hoto, M. Arenales & F. Marques. Um novo procedimento para o cálculo de mochilas compartimentadas. Investigação Operacional 22:213-34, 2002
With M. Fampa. A new relaxation in conic form for the Euclidean Steiner Problem in Rn. RAIRO-Operations Research 35(4): 383-94, 2001
With Ph. Michelon & S. Ripeau. Un algorithme pour la bipartition d’un graphe en sous-graphes de cardinalité fixée. RAIRO – Operations Research, 35(4):401-14, 2001
With M. Rozenthal, D.D. Lages & E. Engelhardt. Desenvolvimento de aplicativo usando inteligência artificial para classificação de pacientes esquizofrênicos segundo perfis neuropsicológicos. Arquivos Brasileiros de Psiquiatria, Neurologia e Medicina Legal 95(74):39-42, 2000
With H.H. Yanasse & N.Y. Soma. An algorithm for determining the k-best solutions of the one-dimensional knapsack problem. Pesquisa Operacional 20(1):117-134, 2000
With R. Figueiredo. O Problema do Caixeiro Viajante Assimétrico: Limites Inferiores e um novo Algoritmo de Separação. Investigação Operacional 20(2):127-46, 2000
With D. Mauricio. A Boolean penalty method for zero-one nonlinear programming. Journal of Global Optimization 16:343-54, 2000
With P. Michelon & A.E. Xavier. The Euclidian Steiner tree problem in Rn: A mathematical programming formulation. Annals of Operation Research 96:209-20, 2000
With H. Barbosa, F. Raupp, C. Lavor & H. Lima. A hybrid genetic algorithm for finding stable conformations of small molecules. Proceedings of the VIth Brazilian Symposium on Neural Networks 1:90-4, 2000
With C.C. Ribeiro, S.C.S. Porto & C.C. de Souza. A new formulation for scheduling unrelated processors under precedence constraints. RAIRO-Operations Research 33(1): 87-92, 1999
With L.S. Ochi & R.M.V. Figueiredo. A new self-organizing strategy based on elastic networks for solving the Euclidean traveling salesman problem. Lectures Notes in Artificial Intelligence, 1416: 479-87, 1998
With D. Mauricio. A relationship between global optimization and 0-1 nonlinear programming. Pesquisa Operacional 17(2):165-72, 1997
With M. Minoux & G. Plateau. A O(n) algorithm for projecting a vector on the intersection of a hyperplane and Rn+. RAIRO- Operations Research 31(1): 07-16, 1997
With D. Mauricio. A trust region method for zero-one nonlinear programming, RAIRO – Operations Research 31(4):331-41, 1997
With V. Parada-Daza. Un Nuevo Método de Solución para el Problema de Equilibrio de Tráfico Generalizado. Revista del Instituto Chileno de Investigación de Operaciones (ICHIO) 4(2):29-41, 1995
With D.J. Aloise. Uma classe de algoritmos aproximativos decrescentes para o problema “bin-packing”. Revista Brasileira de Computação, 6:3-12, 1993
With L. Pradenas-Rojas. Un Método de Solución para el Problema de Camino Mínimo con Múltiples Objetivos. Investigación Operativa 3:191-200, 1993
With H. Reinoso. Lagrangean decomposition in integer linear programming: A new scheme. INFOR 30:1-5, 1992
With A. Candia Vejar. Algoritmos de reducción para el problema de Steiner en dígrafos. Trabajos Seleccionados del V CLAIO – Congreso Latino-Ibero-Americano de Investigación Operativa e Ingeniería de Sistemas, 63-70, 1992
With P. Souza & A. Candia Vejar. Reduction tests for the Steiner problem in directed graphs. Pesquisa Operacional, 11(2): 48-56, 1991
With J.J.C. Salles. A lower bound for the shortest Hamiltonean path in directed graphs. OR Spektrum, 13: 99-102, 1991
With G.G. de Paula Jr. Uma heurística de decomposição primal para a solução de problemas não capacitados de localização de p-medianas. Experientiae 30(10):123-134, 1989
With G.G. de Paula Jr. A linear-time median-finding for projecting a vector on the simplex of Rn. Operations Research Letters 8:219-2, 1989
With Lomba Rosa, L.F. Algoritmo O(n) para o problema de programação linear da mochila (knapsack) 0-1. Pesquisa Operacional 8:1-19, 1988
A New Linear Programming for the Shortest s-Directed Spanning Tree Problem. Journal of Combinatorics, Information and System Sciences. 11(2-4):53-6, 1986
With A.G. Alvarenga. Um método aproximado para a solução do problema de cortes de placas a duas dimensões. Revista Brasileira de Engenharia, Caderno de Engenharia Naval 3(1):79-90, 1986
With G.G. de Paula Jr. Desenvolvimento de uma metodologia para a solução de alocação ótima de tripulação em rotas aéreas. Anais do XI Simpósio Brasileiro de Pesquisa Operacional (1978).
HONOURS
Doctor Honoris Causa, Université Paris XIII & Université Paris Dauphine (2020)
