Maculan Nelson

Nelson Maculan

Information about the author Nelson Maculan will soon be added to the site.
Found 39 papers in total
A new relaxation in conic form for the Suclidean Steiner problem in ℜn
A new relaxation in conic form for the Suclidean Steiner problem in ℜn
2001
In this paper, we present a new mathematical programming formulation for the Euclidean...
Column-generation in integer linear programming
Column-generation in integer linear programming
2003
We present an exact method for integer linear programming problems that combines...
Stronger K-tree relaxations for the vehicle routing problem
Stronger K-tree relaxations for the vehicle routing problem
2004
A Lagrangian based exact solution algorithm for the vehicle routing problem (VRP),...
Performance evaluation of a family of criss-cross algorithms for linear programming
Performance evaluation of a family of criss-cross algorithms for linear programming
2003
In this article we evaluate a family of criss-cross algorithms for linear programming...
A new procedure for the calculation of the compartmented knapsack problem
A new procedure for the calculation of the compartmented knapsack problem
2002
It considers the classic knapsack problem. It admits that items must be grouped in...
The volume algorithm revisited: Relation with bundle methods
The volume algorithm revisited: Relation with bundle methods
2002
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle...
The asymmetric travelling salesman problem: Lower bounds and a new separation algorithm
The asymmetric travelling salesman problem: Lower bounds and a new separation algorithm
2000
Several integer programming formulations to the Asymmetric Travelling Salesman Problem...
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation
2000
A nonconvex mixed-integer programming formulation for the Euclidean Steiner Tree...
Optimization problems related to the cut of paper reels: A dual approach
Optimization problems related to the cut of paper reels: A dual approach
1995
A mathematical model to the problem of minimizing paper losses and the total time for...
Lagrangean methods for 0-1 quadratic problems
Lagrangean methods for 0-1 quadratic problems
1993
Three Lagrangean methods for 0-1 quadratic programming are presented. The first one...
An approach for the Steiner problem in directed graphs
An approach for the Steiner problem in directed graphs
1991
The authors present a scheme to solve the Steiner problem in directed graphs using a...
Lagrangean decomposition for integer nonlinear programming with linear constraints
Lagrangean decomposition for integer nonlinear programming with linear constraints
1991
The authors present a Lagrangean decomposition to study integer nonlinear programming...
Lagrangean decomposition in integer linear programming: A new scheme
Lagrangean decomposition in integer linear programming: A new scheme
1992
The authors present a new Lagrangean decomposition scheme for integer linear...
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
A linear-time median-finding algorithm for projecting a vector on the simplex of ℝn.
1989
An O(n) time algorithm for the projection of a vector is presented on the simplex of...
An O(n3) worst case bounded special LP knapsack (0-1) with two constraints
An O(n3) worst case bounded special LP knapsack (0-1) with two constraints
1988
In this paper it is shown that a linear knapsack 0-1 problem amended with a nontrivial...
Papers per page: