Maculan Nelson

Nelson Maculan

Information about the author Nelson Maculan will soon be added to the site.
Found 39 papers in total
Feasibility check for the distance geometry problem: an application to molecular conformations
Feasibility check for the distance geometry problem: an application to molecular conformations
2017
The distance geometry problem (DGP) consists in finding an embedding in a metric space...
Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions
Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions
2016
We propose algorithmic frameworks based on the iterated local search (ILS)...
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
2016
The Euclidean Steiner tree problem (ESTP) in Rn is to find a shortest network...
An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm
An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm
2014
The backpropagation algorithm is one of the most used tools for training artificial...
Semidefinite relaxation for linear programs with equilibrium constraints
Semidefinite relaxation for linear programs with equilibrium constraints
2013
In this paper, we present a semidefinite programming (SDP) relaxation for linear...
A new formulation for scheduling unrelated processor under precedence constraints
A new formulation for scheduling unrelated processor under precedence constraints
1999
We give a new formulation for the problem of task scheduling into unrelated processors...
Minmax regret combinatorial optimization problems: an AlgorithmicPerspective
Minmax regret combinatorial optimization problems: an AlgorithmicPerspective
2011
Uncertainty in optimization is not a new ingredient. Diverse models considering...
Multi‐service multi‐facility network design under uncertainty
Multi‐service multi‐facility network design under uncertainty
2012
The problem of designing high speed networks using different modules of link...
Recent advances on the Discretizable Molecular Distance Geometry Problem
Recent advances on the Discretizable Molecular Distance Geometry Problem
2012
The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in...
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization
2012
This paper addresses multicriteria combinatorial optimization problems involving one...
Strong bounds with cut and column generation for class‐teacher timetabling
Strong bounds with cut and column generation for class‐teacher timetabling
2012
This work presents an integer programming formulation for a variant of the...
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
2011
This work considers the problem of estimating the relative positions of all atoms of a...
An iterative local search approach applied to the optimal stratification problem
An iterative local search approach applied to the optimal stratification problem
2010
Stratified sampling is a technique that consists in separating the elements of a...
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Reformulations and solution algorithms for the maximum leaf spanning tree problem
2010
Given a graph G = ( V , E ), the maximum leaf spanning tree problem (MLSTP) is to find...
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem
2009
We use reformulation techniques to model and solve a complex sphere covering problem...
Acyclic orientations with path constraints
Acyclic orientations with path constraints
2008
Many well–known combinatorial optimization problems can be stated over the set...
A problem of cutting with segmented patterns
A problem of cutting with segmented patterns
2003
In this paper we will present the application of the Compartmented Knapsack Problem...
A branch-and-prune algorithm for the molecular distance geometry problem
A branch-and-prune algorithm for the molecular distance geometry problem
2008
The Molecular Distance Geometry Problem consists in finding the positions in R 3 of...
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
2006
In this paper we present branch-and-bound (B&B) strategies for two-stage...
A note on characterizing canonical cuts using geometry
A note on characterizing canonical cuts using geometry
2005
In this technical note we introduce a set of cuts for 0–1 integer programming...
A column generation approach for SONET ring assignment
A column generation approach for SONET ring assignment
2006
In this article we consider the SONET ring assignment problem (SRAP). The authors...
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
2005
An O( n 2 ) algorithm is presented for the n jobs m parallel machines problem with...
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
2005
The problem of finding a fundamental cycle basis with minimum total cost in a graph...
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
2001
A branch-and-bound method for solving the min cut with size constraint problem is...
Papers per page: