Nelson Maculan

According to our database1, Nelson Maculan authored at least 114 papers between 1987 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
New proposals for modelling and solving the problem of covering solids using spheres of different radii.
RAIRO Oper. Res., 2020

Modelling and solving the perfect edge domination problem.
Optim. Lett., 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

Cycle-based formulations in Distance Geometry.
CoRR, 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

An integer linear optimization model to the compartmentalized knapsack problem.
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

A new formulation for the Safe Set problem on graphs.
Comput. Oper. Res., 2019

2018
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing.
Networks, 2018

Trends in operational research approaches for sustainability.
Eur. J. Oper. Res., 2018

<i>k</i>-Adaptive Routing for the Robust Network Loading Problem.
Electron. Notes Discret. Math., 2018

The Distance Polytope for the Vertex Coloring Problem.
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

New Error Measures and Methods for Realizing Protein Graphs from Distance Data.
Discret. Comput. Geom., 2017

2016
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits.
Transp. Sci., 2016

A Decomposition Algorithm for Nested Resource Allocation Problems.
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

Distance geometry approach for special graph coloring problems.
CoRR, 2016

2015
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles.
Optim. Lett., 2015

Preface.
Math. Comput. Simul., 2015

A speed and departure time optimization algorithm for the pollution-routing problem.
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
Euclidean Distance Geometry and Applications.
SIAM Rev., 2014

Preface.
RAIRO Oper. Res., 2014

Discretization orders for protein side chains.
J. Glob. Optim., 2014

An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm.
Int. Trans. Oper. Res., 2014

Preface.
Discret. Appl. Math., 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
Semidefinite relaxation for linear programs with equilibrium constraints.
Int. Trans. Oper. Res., 2013

Formulations for the Minimum 2-Connected Dominating Set Problem.
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

Solving the molecular distance geometry problem with inaccurate distance data.
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
Recent advances on the Discretizable Molecular Distance Geometry Problem.
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

The discretizable molecular distance geometry problem.
Comput. Optim. Appl., 2012

Strong bounds with cut and column generation for class-teacher timetabling.
Ann. Oper. Res., 2012

Multi-service multi-facility network design under uncertainty.
Ann. Oper. Res., 2012

A Parallel BP Algorithm for the Discretizable Distance Geometry Problem.
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
Minmax regret combinatorial optimization problems: an Algorithmic Perspective.
RAIRO Oper. Res., 2011

Hyperbolic smoothing and penalty techniques applied to molecular structure determination.
Oper. Res. Lett., 2011

On the computation of protein backbones by using artificial backbones of hydrogens.
J. Glob. Optim., 2011

Molecular distance geometry methods: from continuous to discrete.
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
An exact algorithm for the stratification problem with proportional allocation.
Optim. Lett., 2010

A branch-and-cut algorithm for partition coloring.
Networks, 2010

An iterative local search approach applied to the optimal stratification problem.
Int. Trans. Oper. Res., 2010

Reformulations and solution algorithms for the maximum leaf spanning tree problem.
Comput. Manag. Sci., 2010

A Distributed Dynamics for WebGraph Decontamination.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

2009
Molecular Distance Geometry Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem.
Optim. Lett., 2009

Edge-swapping algorithms for the minimum fundamental cycle basis problem.
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

Reformulation techniques in mathematical programming.
Discret. Appl. Math., 2009

Reformulation in mathematical programming: An application to quantum chemistry.
Discret. Appl. Math., 2009

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
Discret. Appl. Math., 2009

NLPToolbox: an open-source nonlinear programming tool.
Proceedings of the 2nd International Conference on Simulation Tools and Techniques for Communications, 2009

On a discretizable subclass of instances of the molecular distance geometry problem.
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

The Molecular Distance Geometry Problem Applied to Protein Conformations.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Acyclic Orientations with Path Constraints.
RAIRO Oper. Res., 2008

Preface.
Math. Program., 2008

On the choice of parameters for the weighting method in vector optimization.
Math. Program., 2008

A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem.
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

A New Neighborhood for the QAP.
Electron. Notes Discret. Math., 2008

2007
The one dimensional Compartmentalised Knapsack Problem: A case study.
Eur. J. Oper. Res., 2007

New formulations for the Kissing Number Problem.
Discret. Appl. Math., 2007

2006
A column generation approach for SONET ring assignment.
Networks, 2006

Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci., 2006

Using Lagrangian dual information to generate degree constrained spanning trees.
Discret. Appl. Math., 2006

2005
A note on characterizing canonical cuts using geometry.
Int. Trans. Oper. Res., 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

Preface.
Ann. 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

Using a Conic Formulation for Finding Steiner Minimal Trees.
Numer. Algorithms, 2004

Stronger K-tree relaxations for the vehicle routing problem.
Eur. J. Oper. Res., 2004

The Kissing Number Problem: A New Result from Global Optimization.
Electron. Notes Discret. Math., 2004

Algorithms for finding minimum fundamental cycle bases in graphs.
Electron. Notes Discret. Math., 2004

Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl., 2004

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2002
The volume algorithm revisited: relation with bundle methods.
Math. Program., 2002

TDR: A Distributed-Memory Parallel Routing Algorithm for FPGAs.
Proceedings of the Field-Programmable Logic and Applications, 2002

2001
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée.
RAIRO Oper. Res., 2001

A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ.
RAIRO Oper. Res., 2001

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.
Electron. Notes Discret. Math., 2001

2000
A Boolean Penalty Method for Zero-One Nonlinear Programming.
J. Glob. Optim., 2000

The Euclidean Steiner tree problem in R<sup>n</sup>: A mathematical programming formulation.
Ann. Oper. Res., 2000

A Hybrid Genetic Algorithm for Finding Stable Conformations of Small Molecules.
Proceedings of the 6th Brazilian Symposium on Neural Networks (SBRN 2000), 2000

1999
A new formulation for scheduling unrelated processor under precedence constraints.
RAIRO Oper. Res., 1999

1998
Characterizing and Edge-colouring Split-indifference Graphs.
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
Foreword.
Ann. Oper. Res., 1994

1993
Lagrangean Methods for 0-1 Quadratic Problems.
Discret. Appl. Math., 1993

1991
Lagrangean decomposition for integer nonlinear programming with linear constraints.
Math. Program., 1991

An approach for the Steiner problem in directed graphs.
Ann. Oper. Res., 1991

1987
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms.
Discret. Appl. Math., 1987


  Loading...