Nelson Maculan Filho

ORCID:

https://orcid.org/0000-0002-3897-3356


Formação:

  • Universidade Federal do Rio de Janeiro

    Engenharia de Produção | Doutorado | 1972 - 1975

  • Université Pierre et Marie Curie

    Estatística-Matemática (DEA) | Mestrado | 1966 - 1967

  • Universidade Federal de Ouro Preto

    Engenharia de Minas e Metalurgia | Graduação | 1961 - 1965

  • Universite Paris-Dauphine

    | Livre Docência | 0 - Agora

  • Universidade Federal do Rio de Janeiro

    | Livre Docência | 0 - Agora
Laboratórios:
Nuvens de Palavras:
Artigos:

(25.79% artigos com DOI)

Titulo DOI Ano
Method to Forecast the Presidential Election Results Based on Simulation and Machine Learning 10.3390/computation12030038 2024
AT: Asynchronous Teleconsultation for Health Centers in Rural Areas of Peru 10.3991/ijoe.v20i04.44511 2024
Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic 10.1016/j.cor.2024.106604 2024
Duality in convex optimization for the hyperbolic augmented Lagrangian 10.1007/s40590-024-00611-w 2024
Dislocation hyperbolic augmented Lagrangian algorithm in convex programming 10.11121/ijocta.1402 2024
A constraint qualification for the dislocation hyperbolic augmented Lagrangian algorithm 10.1016/j.rico.2024.100429 2024
A new second¿order conic optimization model for the Euclidean Steiner tree problem in Rd$mathbb {R}^d$ 10.1111/itor.13265 2023
A two-phase multi-objective metaheuristic for a green UAV grid routing problem 10.1007/s11590-023-02013-9 2023
Effects of multiple prepayments and green investment on an EPQ model 10.3934/jimo.2022234 2023
A new heuristic for the Euclidean Steiner Tree Problem in $${mathbb {R}}^n$$ 10.1007/s11750-022-00642-4 2023
A machine learning based branch-cut-and-Benders for dock assignment and truck scheduling problem in cross-docks 10.1016/j.tre.2023.103263 2023
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization                     10.1051/ro/2023153 2023
Cycle-based formulations in Distance Geometry 10.5802/ojmo.18 2023
A green inventory model with the effect of carbon taxation 10.1007/s10479-021-04143-8 2022
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$mathbb {R}^d$$ 10.1007/s10898-021-01001-6 2022
Capacitated clustering problems applied to the layout of IT-teams in software factories 10.1007/s10479-020-03785-4 2022
A new penalty/stochastic approach to an application of the covering problem: the Gamma Knife treatment 10.1051/ro/2020016 2021
Using multiflow formulations to solve the Steiner tree problem in graphs 10.1051/ro/202002 2021
TUTORIAL CONVIDADO: Pesquisa Operacional em Época de Conflitos Armados, Pandemias e Catástrofes Naturais 10.4322/PODes.2021.001 2021
CONSIDERAÇÃO DE EMISSÕES DE GASES DE EFEITO ESTUFA NO PLANEJAMENTO DE LONGO PRAZO DA EXPANSÃO DA GERAÇÃO POR MEIO DO MÉTODO AHP 10.12957/cadest.2020.55393 2021
On distance graph coloring problems 10.1111/itor.12626 2021
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem 10.1051/ro/2020065 2021
Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon 10.1016/j.tre.2020.102201 2021
Essays on OR in ALIO country members (part 2) 10.1007/s11750-021-00596-z 2021
Heuristic approach applied to the optimum stratification problem 10.1051/ro/2021051 2021
Improved robust shortest paths by penalized investments 10.1051/ro/2021086 2021
A new approach for the traveling salesperson problem with hotel selection 10.1016/j.ejtl.2021.100062 2021
NEW PROPOSALS FOR MODELLING AND SOLVING THE PROBLEM OF COVERING SOLIDS USING SPHERES OF DIFFERENT RADII 2020
Solution Algorithms for Minimizing the Total Tardiness with Budgeted Processing Time Uncertainty 2020
Modelling and solving the perfect edge domination problem 10.1007/s11590-018-1335-x 2020
A Smoothing Optimization Approach Applied to the Supervised MDS Method 2020
Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds 10.1007/s10957-020-01725-7 2020
Essays on OR in ALIO country members (part 1) 10.1007/s11750-020-00583-w 2020
A Brief History of Heuristics: from Bounded Rationality to Intractability 10.1109/tla.2020.9398639 2020
An Integer Linear Optimization Model to the Compartmentalized Knapsack Problem 2019
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in ℝ𝑛 2019
A mathematical programming formulation for the Hartree-Fock Problem on open-shell systems 2019
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing 10.1016/j.cor.2019.02.004 2019
A new formulation for the Safe Set problem on graphs 10.1016/j.cor.2019.07.004 2019
Covering a body using unequal spheres and the problem of finding covering holes 2019
Notes on models for distance coloring problems 2019
Solving the bifurcated and non-bifurcated robust network loading problem with k-adaptive routing 2018
Trends in operational research approaches for sustainability 10.1016/j.ejor.2017.12.014 2018
ESCALONAMENTO MULTIDIMENSIONAL LOCAL: UMA ABORDAGEM VIA SUAVIZAÇÃO HIPERBÓLICA 10.12957/cadest.2018.36483 2018
k -Adaptive Routing for the Robust Network Loading Problem 10.1016/j.endm.2018.01.011 2018
Feasibility check for the distance geometry problem: an application to molecular conformations Agosti 2017
On the Convergence Rate of an Inexact Proximal Point Algorithm for Quasiconvex Minimization on Hadamard Manifolds 10.1007/s40305-016-0129-z 2017
New error measures and methods for realizing protein graphs from distance data 2017
A Co-opetitive Framework for the Hub Location Problems in Transportation Networks 2017
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model 10.1016/j.endm.2017.10.025 2017
Large neighborhoods with implicit customer selection for vehicle routing problems with profits 2016
Iterated Local Search Algorithms for the Euclidean Steiner Tree Problem in N Dimensions.  2016
A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem 10.1051/ro/2015022 2016
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space 2016
An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs 2016
A DECOMPOSITION ALGORITHM FOR NESTED RESOURCE ALLOCATION PROBLEMS 2016
Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds 10.1007/s40305-016-0133-3 2016
What will be the proxy value for a Brazilian utility company triggering its demand side management in the light of price elasticity of demand? 2016
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles 2015
Clifford Algebra and the Discretizable Molecular Distance Geometry Problem 2015
Making real progress toward more sustainable societies using decision support models and tools: Introduction to the special volume 10.1016/j.jclepro.2015.05.047 2015
A speed and departure time optimization algorithm for the pollution-routing problem 2015
MRP OPTIMIZATION MODEL FOR A PRODUCTION SYSTEM WITH REMANUFACTURING 10.1590/0101-7438.2015.035.02.0311 2015
CONHECIMENTO DE MATEMÁTICA PARA O ENSINO: UM ESTUDO COLABORATIVO SOBRE NÚMEROS RACIONAIS 2015
Integer programming formulations applied to optimal allocation in stratified sampling 2015
Euclidean distance geometry and applications 2014
Discretization Orders for Protein Side Chains 2014
An Evaluation of the Bi-hyperbolic Function in the Optimization of the Backpropagation Algorithm 2014
A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem 2014
Hub-and-Spoke Network Design and Fleet Deployment for String Planning of Liner Shipping 2013
Semidefinite relaxation for linear programs with eqilibrium constraints 2013
Enhanced Compact Models for the Connected Subgraph Problem and for the Shortest Path Problem in Digraphs with Negative Cycles 2013
Single string planning problem arising in liner shipping industries: A heuristic approach 2013
Solving the molecular distance geometry problem with inaccurate distance data 10.1186/1471-2105-14-S9-S7 2013
Decision-support models and tools for helping to make real progress to more sustainable societies 10.1016/j.jclepro.2013.05.031 2013
Strong bounds with cut and column generation for class-teacher timetabling 2012
The discretizable molecular distance geometry problem 2012
Recent advances on the discretizable molecular distance geometry problem 2012
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization 2012
Multi-service multi-facility network design under uncertainty 2012
A Model to the Ellipsoidal Filling Problem 2012
Molecular distance geometry methods: From continuous to discrete 2011
Hyperbolic smoothing and penalty techniques applied to molecular structure determination 2011
On the Computation of Protein Backbones by using Artificial Backbones of Hydrogens 2011
Minmax regret combinatorial optimization problems: An algorithmic perspective 2011
A branch-and-cut algorithm for partition coloring 2010
An exact algorithm for the stratification problem with proportional allocation 2010
REFORMULATIONS AND SOLUTION ALGORITHMS FOR THE MAXIMUM LEAF SPANNING TREE PROBLEM 2010
An iterative local search approach applied to the optimal stratification problem 10.1111/j.1475-3995.2010.00773.x 2010
DISCRETE APPROACHES FOR SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS USING NMR DATA 10.2316/J.2010.210-1025 2010
On the computation of protein backbones by using artificial backbones of hydrogens 10.1007/s10898-010-9584-y 2010
An efficient FFD method to solve the one-dimensional stock cutting problem 2010
A Study of the Compartimentalized Knapsack Problem with Additional Restrictions 10.1109/TLA.2010.5538401 2010
Double variable neighbourhood search with smoothing for the molecular distance geometry problem 2009
Reformulation in mathematical programming: An application to quantum chemistry 2009
Edge-swapping algorithms for the minimum fundamental cycle basis problema 2009
A Relax-and-Cut Algorithm for the Prize-Collecting Steiner Problem in Graphs 2009
An existence result for Minty variational inequalities 2009
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem 2009
The tricriterion shortest path problem with at least two bottleneck objective functions 2009
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles 10.1111/j.1475-3995.2008.00681.x 2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives 2009
On the definition of artificial backbones for the discretizable molecular geometry problem 2009
On the choice of parameters for weighting method in vector optimization 2008
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule 2008
A branch-and-prune algorithm for the molecular distance geometry problem 2008
Acyclic orientations with path constraints 2008
A new neighborhood for the QAP 2008
Integração de sistemas computacionais e modelos logísticos de otimização para prevenção e combate à dengue 2008
New formulations for the kissing number problem 2007
The one dimensional compartimentalised knapsack problem: a case study 2007
Solving Hartree-Fock systems with global optimization methods 2007
Using Lagrangian Dual Information to Generate Degree Constrained Minimum Spanning Trees 2006
A column generation approach for SONET ring assignment 2006
Enhancing a branch and bound algorithm for two-stage stochastic integer network design based models 2006
A Framework of Computational Systems and Optimization Models for the Prevention and Combat of Dengue 2006
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling 2005
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases 2005
A note on characterizing canonical cuts using geometry 2005
B & B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks under Uncertainty 2005
Using a conic formulation for finding Steiner minimal trees 2004
Stronger K-tree relaxations for the vehicle routing problem 2004
A function to test methods applied to global minimization of potential energy molecules 2004
Telecommunication Network Capacity Design for Uncertain Demand 2004
Algorithms for finding minimum fundamental cycle bases in graphs 2004
The Kissing Number Problem: A New Result from Global Optimization 2004
Performance evaluation of a family of criss-cross algorithms for linear programming 2003
An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn 2003
A greedy search for the three-dimensional bin packing problem: the packing static stability case 2003
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems 2003
Um problema de corte com padrões compartimentados 2003
Microcanonical optimization for the Euclidean Steiner Problem in Rn with application to phylogenetic inference 2003
Column-generation in integer linear programming 2003
Um metodo deterministico para otimizacao global 2003
The volume algorithm revisited: relation with bundle methods 2002
Um novo procedimento para o cálculo de mochilas compartimentadas 2002
Uma heurística para o problema de programação de horários em escolas 2001
Un algorithme pour la bipartition d'un graphe en sus-graphes de cardinalité fixée 2001
A new relaxation in conic form for the Euclidean Steiner Problem in Rn 2001
Transient-states analysis of a 2-species dynamical ecological model via KCC-theory 2001
An algorithm for determining the k-best solutions of the one-dimensional knapsack problem 2000
The Euclidean Steiner Tree Problem in Rn: A Mathematical programing formulation 2000
A Boolean Penalty Method for 0-1 Nonlinear Programming 2000
Searching and Analysing Neuropsychological Patterns in Schizophrenia with artificial neural networks 2000
O Problema do Caixeiro Viajante Assimétrico: Limites Inferiores e um novo Algoritimo de Separção 2000
Melhorando Quadros de Horário de Escolas através de Caminhos Mínimos 2000
Desenvolvimento de Aplicativo Usando Inteligência Artificial para Classificação de Pacientes de Esquizofrênicos Segundo Perfis Neuropsicológicos 2000
A new formulation for scheduling unrelated processors under precedence constraints 1999
The study of Steiner points associated with the vertices of regular tetrahedra joined together at common faces 1998
Characterizing and edge-coloring split-indifference graphs 1998
A New Self-Organizing Strategy based on Elastic Networks for solving the Euclidean Traveling Salesman Problem 1998
A trust region method for zero-one nonlinear programming 1997
A O(n) algorithm for projecting a vector on the intersection of a hyperplane and Rn+ 1997
A relationship between global optimization and 0-1 nonlinear programming 1997
O Problema de Compras 1996
Un Nuevo Método de Solución para el Problema de Equlibrio de Tráfico Generalizado 1995
Optimization Problems Related to the Cut of Paper Reels: a Dual Approach 1995
Branch & Bound Schemes using Lagrangean Decomposition Techniques for 0-1 Quadratic Knapsack Problems 1995
Lagrangean methods for 0-1 quadratic problems 1993
Un Método de Solución para el Problema de Camino Mínimo con Múltiples Objetivos 1993
Lagrangean decomposition in integer linear programming: a new scheme 1992
Column-generation in Linear Programming with Bounding Variable Constraints and its Application in Integer Programming 1992
An Approach for the Steiner problem in directed graphs 1991
A lower bound for the shortest Hamiltonean path in directed graphs 1991
Lagrangean decomposition for integer nonlinear programming with linear constraints 1991
Uma Classe de Algoritmos Aproximativos Decrescentes para o Problema bin-packing 1991
Reduction Tests for the Steiner Problem in Directed Graphs 1991
Combinatorial Optimization in Computer Networks 1990
Uma Heurística de Decomposição Primal para a Solução de Problemas Não Capacitados de Localização de p-Medianas 1989
A Linear-Time Median-Finding for Projecting a Vector on the Simplex of Rn 1989
An O(n3) Worst Case Bounded Special LP Knapsack (0-1) with Two Constraints 1988
Le Problème de Steiner sur un Graphe Orienté: Formulations et Relaxations 1988
Algoritmo O(n) para o Problema de Programação Linear da Mochila (Knapsack) 0-1 1988
Linear Programming Problem for which Karmarkar's Algorithm is Strongly Polynomial 1988
Análise do Aspecto Combinatório da Localização Dinâmica de Carvoarias em Plantações de Eucaliptos 1988
Análise do Aspecto Combinatório da Localização Dinâmica de Carvoarias em Plantações de Eucaliptos 1988
Steiner Problem in Graphs 1987
Lagrangean Relaxation for a Lower Bound to a Set Partitioning Problem with Side Constraints 1987
Um Método Aproximado para a Solução do Problema de Cortes de Placas a Duas Dimensões 1986
A New Linear Programming for the Shortest s-Directed Spanning Tree Problem 1986
On Deep Disjunctive Cutting Planes for Set Partitionig: A Computationally Oriented Research 1984
Relaxation Lagrangienne: le Problème du Knapsack 0-1 1983
Variáveis Ordenadas por Grupos 1982
Algoritmo de Khachiyan para a Resolução de Problemas de Programação Linear 1981
Comentários sobre um Algoritmo para a Solução Aproximada do Problema da Mochila 1981
The Administration of Standard Length Telephone Cable Reels 1981
Aspectos Computacionais em Programação Linear 1981
On the Solution of the Standard Length Telephone Cable Reels Problems 1981
Solucões Aproximadas do Problema de Programação Bivalente Utilizando Dualidade em Programação Inteira 1980
Localização Ótima de Torres de Transmissão Utilizando Teoria dos Grafos 1979
Eventos:

(4.88% eventos com DOI)

Titulo DOI Ano
MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data 10.15439/2020F35 2020
ON A DISCRETIZABLE SUBCLASS OF INSTANCES OF THE MOLECULAR DISTANCE GEOMETRY PROBLEM 2009
THE MOLECULAR DISTANCE GEOMETRY PROBLEM APPLIED TO PROTEIN CONFORMATIONS 2009
COMPARISONS BETWEEN AN EXACT AND A METAHEURISTIC ALGORITHM FOR THE MOLECULAR DISTANCE GEOMETRY PROBLEM 10.1145/569901.1569948 2009
COMPUTING ARTIFICIAL BACKBONES OF HYDROGEN ATOMS IN ORDER TO DISCOVER PROTEIN BACKBONES 2009
AN ARTIFICIAL BACKBONE OF HYDROGENS FOR FINDING THE CONFORMATION OF PROTEIN MOLECULES 2009
ALGORITHMS FOR THE ROBUST SHORTEST PATH 2008
AN ILS APPROACH APPLIED TO THE OPTIMAL STRATIFICATION PROBLEM 2008
MINIMIZING EARLINESS AND TARDINESS PENALTIES ON A SINGLE MACHINE SCHEDULING PROBLEM WITH DISTINCT DUE WINDOWS AND SEQUENCE-DEPENDENT SETUP TIMES 2008
REFORMULATIONS AND SOLUTION ALGORITHMS FOR THE MAX-LEAF SPANNING TREE PROBLEM 2008
SOLVING THE TRIDIMENSIONAL EUCLIDEAN STEINER TREE PROBLEM BY AN EFFICIENT HEURISTIC 2008
UMA METAHEURÍSTICA GRASP PARA O PROBLEMA DE ÁRVORE DE STEINER EUCLIDIANA TRIDIMENSIONAL 2008
UM PROBLEMA DE CAMINHO TRI-OBJETIVO 2008
SEMIDEFINITE RELAXATION AND BRANCH-AN-BOUND ALGORITHM FOR LPECS 2008
ALGORITMOS DE OTIMIZAÇÃO PARA O PROBLEMA DE PLANEJAMENTO DE REDES CELULARES DE TERCEIRA GERAÇÃO 2008
A REVERSE ALGORITHM FOR THE TRICRITERION SHORTEST PATH PROBLEM 2008
TOWARDS THE OPTIMAL SOLUTION OF THE MULTIPROCESSOR SCHEDULING PROBLEM WITH COMMUNICATION DELAYS 2007
FORMULAÇÕES DE PROGRAMAÇÃO INTEIRA PARA O PROBLEMA DE ESTRATIFICAÇÃO CONSIDERANDO ALOCAÇÃO UNIFORME, PROPORCIONAL E DE NEYMAN 2007
Integer programming problems using polynomial number of variables and constraints for combinatorial optimization problems in graphs 2003
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps 2003
A mathematical programming formulation for the multiprocessor scheduling problem with communication delays 2003
Explorando a estratégia da logística para alavancar o desenvolvimento regional 2002
Exploring the logistics strategy for leveraging the regional development in Brazil 2002
An algorithm for large scale set covering problem with applications to the crew pairing problem 2002
Redes de Kohonen ativas no agrupamento de padrões de Glass 2001
Resolvendo Problemas de Distribuição de Derivados de Petróleo com SisGRAFOS 1996
O Método Feixe Nível Proximal para Problemas Min-Max e Otimização Convexa Não Suave 1996
Genetic Algorithm for the Travelling Purchage Problem 1995
Algoritmos de Reducción para el Problema de Steiner en Dígrafos 1992
Extrapolação em Penalização Hiperbólica 1986
O Problema de Steiner em Grafos 1986
A Linear Programming for the Shortest s-Directed Tree Problem 1986
Métodos Computacionais e Estatísticos em Cartografia Geológica 1984
Controle Ótimo em Planejamento de Capturas de Lagostas no Nordeste do Brasil 1984
Distribuição Ótima da Idade como Determinante na Pesca de Atuns 1984
Kriging Theory and Applications for Automated Cartography 1983
O Método do simplex como Solução de Problemas de Programação Linear com Variáveis Ordenadas 1982
Otimização da Pesca Industrial - Um Modelo de Programação Linear Estocástica 1982
Contribuição aos Problemas de Programação Linear com Variáveis Limitadas de Maneira Explícita 1980
Tópicos de Dualidade em Programação Inteira Bivalente 1978
Sampling from Distributions using Piecewise Functional Approximation 1976
Publicações:
Minha Rede: