Nelson Maculan
Orcid: 0000-0002-3897-3356
According to our database1,
Nelson Maculan
authored at least 135 papers
between 1987 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on abc.org.br
On csauthors.net:
Bibliography
2025
Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem.
Int. Trans. Oper. Res., March, 2025
2024
Commun. Stat. Simul. Comput., June, 2024
Method to Forecast the Presidential Election Results Based on Simulation and Machine Learning.
Comput., March, 2024
Int. J. Online Biomed. Eng., 2024
Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic.
Comput. Oper. Res., 2024
2023
Optim. Lett., December, 2023
A new second-order conic optimization model for the Euclidean Steiner tree problem in R d $\mathbb {R}^d$.
Int. Trans. Oper. Res., November, 2023
RAIRO Oper. Res., 2023
2022
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $\mathbb {R}^d$.
J. Glob. Optim., 2022
Capacitated clustering problems applied to the layout of IT-teams in software factories.
Ann. Oper. Res., 2022
2021
A new penalty/stochastic approach to an application of the covering problem: The gamma knife treatment.
RAIRO Oper. Res., 2021
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem.
RAIRO Oper. Res., 2021
RAIRO Oper. Res., 2021
RAIRO Oper. Res., 2021
EURO J. Transp. Logist., 2021
Clarke Subdifferential, Pareto-Clarke Critical Points and Descent Directions to Multiobjective Optimization on Hadamard Manifolds.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2021
2020
New proposals for modelling and solving the problem of covering solids using spheres of different radii.
RAIRO Oper. Res., 2020
Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds.
J. Optim. Theory Appl., 2020
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty.
Eur. J. Oper. Res., 2020
MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020
2019
A mathematical programming formulation for the Hartree-Fock problem on open-shell systems.
Optim. Lett., 2019
Int. Trans. Oper. Res., 2019
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\).
EURO J. Comput. Optim., 2019
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing.
Comput. Oper. Res., 2019
2018
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing.
Networks, 2018
Eur. J. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2017
Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res., 2017
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model.
Electron. Notes Discret. Math., 2017
Discret. Comput. Geom., 2017
2016
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits.
Transp. Sci., 2016
SIAM J. Optim., 2016
A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem.
RAIRO Oper. Res., 2016
An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs.
RAIRO Oper. Res., 2016
Iterated local search algorithms for the Euclidean Steiner tree problem in <i>n</i> dimensions.
Int. Trans. Oper. Res., 2016
An overview of exact algorithms for the Euclidean Steiner tree problem in <i>n</i>-space.
Int. Trans. Oper. Res., 2016
2015
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles.
Optim. Lett., 2015
Eur. J. Oper. Res., 2015
Modelling Rank Constraints in Mathematical Programming.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm.
Int. Trans. Oper. Res., 2014
Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search.
Proceedings of the Enterprise Information Systems - 16th International Conference, 2014
AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times.
Proceedings of the ICEIS 2014, 2014
2013
Int. Trans. Oper. Res., 2013
Electron. Notes Discret. Math., 2013
An Integer Programming Formulation Applied to Optimum Allocation in Multivariate Stratified Sampling.
CoRR, 2013
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles.
Comput. Oper. Res., 2013
Single string planning problem arising in liner shipping industries: A heuristic approach.
Comput. Oper. Res., 2013
BMC Bioinform., 2013
A Novel Mathematical Formulation for the Strategic Planning of a Reverse Supply Chain Network - Theoretical and Computational Results.
Proceedings of the ICEIS 2013, 2013
2012
Eur. J. Oper. Res., 2012
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization.
Comput. Oper. Res., 2012
Ann. Oper. Res., 2012
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012
On suitable orders for discretizing Molecular Distance Geometry Problems related to protein side chains.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012
2011
RAIRO Oper. Res., 2011
Hyperbolic smoothing and penalty techniques applied to molecular structure determination.
Oper. Res. Lett., 2011
J. Glob. Optim., 2011
Int. Trans. Oper. Res., 2011
A note on "A branch-and-prune algorithm for the molecular distance geometry problem".
Int. Trans. Oper. Res., 2011
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011
2010
Optim. Lett., 2010
Int. Trans. Oper. Res., 2010
Comput. Manag. Sci., 2010
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem.
Optim. Lett., 2009
Math. Methods Oper. Res., 2009
Double variable neighbourhood search with smoothing for the molecular distance geometry problem.
J. Glob. Optim., 2009
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles.
Int. Trans. Oper. Res., 2009
The tricriterion shortest path problem with at least two bottleneck objective functions.
Eur. J. Oper. Res., 2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Proceedings of the 2nd International Conference on Simulation Tools and Techniques for Communications, 2009
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009
Computing artificial backbones of hydrogen atoms in order to discover protein backbones.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009
Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Math. Program., 2008
Int. Trans. Oper. Res., 2008
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule.
Eur. J. Oper. Res., 2008
2007
Eur. J. Oper. Res., 2007
2006
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci., 2006
Discret. Appl. Math., 2006
2005
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem.
Eur. J. Oper. Res., 2005
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res., 2005
2004
A Function to Test Methods Applied to Global Minimization of Potential Energy of Molecules.
Numer. Algorithms, 2004
Eur. J. Oper. Res., 2004
Electron. Notes Discret. Math., 2004
Electron. Notes Discret. Math., 2004
Comput. Optim. Appl., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
2002
Proceedings of the Field-Programmable Logic and Applications, 2002
2001
RAIRO Oper. Res., 2001
RAIRO Oper. Res., 2001
Electron. Notes Discret. Math., 2001
2000
The Euclidean Steiner tree problem in R<sup>n</sup>: A mathematical programming formulation.
Ann. Oper. Res., 2000
Proceedings of the 6th Brazilian Symposium on Neural Networks (SBRN 2000), 2000
1999
RAIRO Oper. Res., 1999
1998
Discret. Appl. Math., 1998
A New Self-Organizing Strategy Based on Elastic Networks for Solving the Euclidean Traveling Salesman Problem.
Proceedings of the Tasks and Methods in Applied Artificial Intelligence, 1998
1994
1993
1991
Math. Program., 1991
1987
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms.
Discret. Appl. Math., 1987