| Publication | Date of Publication | Type |
|---|
A preprocessing technique for quadratic unconstrained binary optimization
Discrete Optimization | 2026-08-06 | Paper |
Solving the minimum labeling global cut problem by mathematical programming
International Transactions in Operational Research | 2025-12-04 | Paper |
| Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times | 2025-10-30 | Paper |
Notes on models for distance coloring problems
Matemática Contemporânea | 2024-04-25 | Paper |
Locality sensitive algotrithms for data mule routing problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
RAIRO - Operations Research | 2021-07-27 | Paper |
New proposals for modelling and solving the problem of covering solids using spheres of different radii
RAIRO - Operations Research | 2020-05-13 | Paper |
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization | 2019-10-18 | Paper |
A hybrid metaheuristic for the minimum labeling spanning tree problem
European Journal of Operational Research | 2019-01-09 | Paper |
| A neighborhood exploration approach with multi-start for extend generalized block-modeling | 2018-10-11 | Paper |
| General variable neighborhood search for the data mule scheduling problem | 2018-10-11 | Paper |
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
Computers & Operations Research | 2018-07-11 | Paper |
A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
Computers & Operations Research | 2016-11-17 | Paper |
An exact cooperative method for the uncapacitated facility location problem
Mathematical Programming Computation | 2015-09-16 | Paper |
A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
EURO Journal on Computational Optimization | 2015-07-31 | Paper |
0-1 quadratic knapsack problems: an exact approach based on a t-linearization
SIAM Journal on Optimization | 2013-04-09 | Paper |
An exact method with variable fixing for solving the generalized assignment problem
Computational Optimization and Applications | 2012-12-12 | Paper |
Generalized resolution search
Discrete Optimization | 2012-06-20 | Paper |
Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions
European Journal of Operational Research | 2012-05-14 | Paper |
An exact site availability approach to modeling the D-FAP
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Crop rotation scheduling with adjacency constraints
Annals of Operations Research | 2012-03-08 | Paper |
A MIP-based local search method for the railway rescheduling problem
Networks | 2011-02-17 | Paper |
A multi-level search strategy for the 0-1 multidimensional knapsack problem
Discrete Applied Mathematics | 2010-05-05 | Paper |
A linearization framework for unconstrained quadratic (0-1) problems
Discrete Applied Mathematics | 2009-06-23 | Paper |
The dynamic frequency assignment problem
European Journal of Operational Research | 2009-01-08 | Paper |
A constraint programming approach for the resource-constrained project scheduling problem
Annals of Operations Research | 2008-09-03 | Paper |
Models and methods for frequency assignment with cumulative interference constraints
International Transactions in Operational Research | 2008-05-29 | Paper |
``Miniaturized'' linearizations for quadratic 0/1 problems
Annals of Operations Research | 2006-03-07 | Paper |
LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
Annals of Operations Research | 2005-01-17 | Paper |
Insertion techniques for static and dynamic resource-constrained project scheduling.
European Journal of Operational Research | 2003-07-30 | Paper |
Generalized assignment type goal programming problem: application to nurse scheduling
Journal of Heuristics | 2002-12-15 | Paper |
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
RAIRO - Operations Research | 2002-08-18 | Paper |
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
RAIRO - Operations Research | 2002-08-18 | Paper |
Scheduling the flying squad nurses of a hospital using a multi-objective programming model
Annals of Operations Research | 2001-01-17 | Paper |
The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
Annals of Operations Research | 2001-01-17 | Paper |
Lagrangean methods for the 0-1 quadratic knapsack problem
European Journal of Operational Research | 1998-10-18 | Paper |
Using the tabu search method for the distribution of supplies in a hospital
Annals of Operations Research | 1995-05-21 | Paper |
Lagrangean methods for 0-1 quadratic problems
Discrete Applied Mathematics | 1993-06-29 | Paper |
Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
Journal of Global Optimization | 1992-07-23 | Paper |
Lagrangean decomposition for integer nonlinear programming with linear constraints
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
The Vehicle Scheduling Problem with Multiple Vehicle Types
The Journal of the Operational Research Society | 1988-01-01 | Paper |
