| Publication | Date of Publication | Type |
|---|
Graphs whose vertices of degree at least 2 lie in a triangle
RAIRO. Operations Research | 2025-01-20 | Paper |
A note on the dislocation hyperbolic transformation function
RAIRO. Operations Research | 2025-01-08 | Paper |
Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
International Transactions in Operational Research | 2025-01-08 | Paper |
| Clarke subdifferential, Pareto-Clarke critical points and descent directions to multiobjective optimization on Hadamard manifolds | 2024-10-29 | Paper |
Dislocation hyperbolic kernel function
Journal of Convex Analysis | 2024-10-17 | Paper |
Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
Optimization | 2024-09-26 | Paper |
A global interior point method for nonconvex geometric programming
Optimization and Engineering | 2024-07-16 | Paper |
Solution algorithms for dock scheduling and truck sequencing in cross-docks: a neural branch-and-price and a metaheuristic
Computers & Operations Research | 2024-07-08 | Paper |
A neural branch-and-price for truck scheduling in cross-docks
Science China. Mathematics | 2024-07-01 | Paper |
Duality in convex optimization for the hyperbolic augmented Lagrangian
Boletín de la Sociedad Matemática Mexicana. Third Series | 2024-05-10 | Paper |
Covering a body using unequal spheres and the problem of finding covering holes
Matemática Contemporânea | 2024-04-25 | Paper |
Notes on models for distance coloring problems
Matemática Contemporânea | 2024-04-25 | Paper |
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
RAIRO - Operations Research | 2024-01-22 | Paper |
On distance graph coloring problems
International Transactions in Operational Research | 2023-11-21 | Paper |
An integer linear optimization model to the compartmentalized knapsack problem
International Transactions in Operational Research | 2023-11-16 | Paper |
A two-phase multi-objective metaheuristic for a green UAV grid routing problem
Optimization Letters | 2023-11-07 | Paper |
A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
International Transactions in Operational Research | 2023-10-04 | Paper |
Cycle-based formulations in distance geometry
OJMO. Open Journal of Mathematical Optimization | 2023-07-12 | Paper |
A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
Top | 2023-07-11 | Paper |
Effects of multiple prepayments and green investment on an EPQ model
Journal of Industrial and Management Optimization | 2023-04-24 | Paper |
Capacitated clustering problems applied to the layout of IT-teams in software factories
Annals of Operations Research | 2022-09-26 | Paper |
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
Journal of Global Optimization | 2022-04-25 | Paper |
| scientific article; zbMATH DE number 7483242 (Why is no real title available?) | 2022-03-02 | Paper |
A green inventory model with the effect of carbon taxation
Annals of Operations Research | 2022-01-20 | Paper |
| A cycle-based formulation for the distance geometry problem | 2021-12-08 | Paper |
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
RAIRO - Operations Research | 2021-07-27 | Paper |
Using multiflow formulations to solve the Steiner tree problem in graphs
RAIRO - Operations Research | 2021-07-27 | Paper |
A new penalty/stochastic approach to an application of the covering problem: the gamma knife treatment
RAIRO - Operations Research | 2021-07-27 | Paper |
Heuristic approach applied to the optimum stratification problem
RAIRO - Operations Research | 2021-07-22 | Paper |
Improved robust shortest paths by penalized investments
RAIRO - Operations Research | 2021-07-19 | Paper |
Preface
Mathematics and Computers in Simulation | 2021-02-19 | Paper |
Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
Journal of Optimization Theory and Applications | 2020-09-10 | Paper |
New proposals for modelling and solving the problem of covering solids using spheres of different radii
RAIRO - Operations Research | 2020-05-13 | Paper |
Modelling and solving the perfect edge domination problem
Optimization Letters | 2020-04-27 | Paper |
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
European Journal of Operational Research | 2020-01-23 | Paper |
A new formulation for the safe set problem on graphs
Computers & Operations Research | 2019-09-25 | Paper |
A mathematical programming formulation for the Hartree-Fock problem on open-shell systems
Optimization Letters | 2019-05-10 | Paper |
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
Computers & Operations Research | 2019-03-27 | Paper |
Solving the bifurcated and nonbifurcated robust network loading problem with \(k\)-adaptive routing
Networks | 2018-10-11 | Paper |
| Algebra and geometry in the calculation of molecular structure. Paper from the 31st Brazilian mathematics colloquium -- 31\(^{\text o}\) Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, July 30 -- August 5, 2017 | 2018-08-21 | Paper |
| The distance polytope for the vertex coloring problem | 2018-08-17 | Paper |
| \(k\)-adaptive routing for the robust network loading problem | 2018-04-11 | Paper |
| Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model | 2018-04-09 | Paper |
On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
Journal of the Operations Research Society of China | 2018-01-12 | Paper |
A co-opetitive framework for the hub location problems in transportation networks
Optimization | 2017-12-15 | Paper |
Feasibility check for the distance geometry problem: an application to molecular conformations
International Transactions in Operational Research | 2017-10-02 | Paper |
Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
Journal of the Operations Research Society of China | 2017-06-30 | Paper |
New error measures and methods for realizing protein graphs from distance data
Discrete & Computational Geometry | 2017-03-23 | Paper |
Hub-and-spoke network design and fleet deployment for string planning of liner shipping
Applied Mathematical Modelling | 2016-12-06 | Paper |
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
Computers & Operations Research | 2016-11-10 | Paper |
Single string planning problem arising in liner shipping industries: a heuristic approach
Computers & Operations Research | 2016-11-10 | Paper |
Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
International Transactions in Operational Research | 2016-10-27 | Paper |
An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
International Transactions in Operational Research | 2016-10-21 | Paper |
An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs
RAIRO. Operations Research | 2016-10-18 | Paper |
A speed and departure time optimization algorithm for the pollution-routing problem
European Journal of Operational Research | 2016-10-06 | Paper |
A decomposition algorithm for nested resource allocation problems
SIAM Journal on Optimization | 2016-06-03 | Paper |
A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem
RAIRO. Operations Research | 2016-04-01 | Paper |
Clifford algebra and the discretizable molecular distance geometry problem
Advances in Applied Clifford Algebras | 2015-11-05 | Paper |
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
Optimization Letters | 2015-03-23 | Paper |
An evaluation of the bihyperbolic function in the optimization of the backpropagation algorithm
International Transactions in Operational Research | 2015-02-25 | Paper |
Discretization orders for protein side chains
Journal of Global Optimization | 2015-01-15 | Paper |
A model to the ellipsoidal filling problem
Vietnam Journal of Mathematics | 2014-04-16 | Paper |
Euclidean distance geometry and applications
SIAM Review | 2014-04-09 | Paper |
A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
| Integer programming problems using a polynomial number of variables and constraints for combinatorial optimization problems in graphs | 2013-06-10 | Paper |
Semidefinite relaxation for linear programs with equilibrium constraints
International Transactions in Operational Research | 2013-05-23 | Paper |
Minmax regret combinatorial optimization problems: an algorithmic perspective
RAIRO - Operations Research | 2013-04-29 | Paper |
| The minimum fundamental cycle basic problem: a new heuristic based on edge swaps | 2013-01-10 | Paper |
Recent advances on the discretizable molecular distance geometry problem
European Journal of Operational Research | 2012-12-29 | Paper |
The discretizable molecular distance geometry problem
Computational Optimization and Applications | 2012-12-13 | Paper |
The discretizable molecular distance geometry problem
Computational Optimization and Applications | 2012-12-13 | Paper |
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
Computers & Operations Research | 2012-11-15 | Paper |
Multi-service multi-facility network design under uncertainty
Annals of Operations Research | 2012-11-15 | Paper |
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Operations Research Letters | 2012-04-05 | Paper |
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Management Science | 2012-02-21 | Paper |
| Relax-and-cut as a preprocessor and warm starter to branch-and-cut | 2012-01-26 | Paper |
Molecular distance geometry methods: from continuous to discrete
International Transactions in Operational Research | 2011-08-17 | Paper |
On the computation of protein backbones by using artificial backbones of hydrogens
Journal of Global Optimization | 2011-06-03 | Paper |
An iterative local search approach applied to the optimal stratification problem
International Transactions in Operational Research | 2011-05-20 | Paper |
Um Método Determinístico para Otimização Global
TEMA - Tendências em Matemática Aplicada e Computacional | 2011-04-04 | Paper |
| scientific article; zbMATH DE number 5863207 (Why is no real title available?) | 2011-03-09 | Paper |
A branch-and-cut algorithm for partition coloring
Networks | 2010-11-24 | Paper |
Acyclic orientations with path constraints
RAIRO - Operations Research | 2010-10-26 | Paper |
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Computational Management Science | 2010-09-20 | Paper |
| On the definition of artificial backbones for the discretizable molecular distance geometry problem | 2010-06-07 | Paper |
An exact algorithm for the stratification problem with proportional allocation
Optimization Letters | 2010-05-03 | Paper |
An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
Pesquisa Operacional | 2010-03-06 | Paper |
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
International Transactions in Operational Research | 2009-10-21 | Paper |
An existence result for Minty variational inequalities
Acta Mathematica Vietnamica | 2009-08-03 | Paper |
Double variable neighbourhood search with smoothing for the molecular distance geometry problem
Journal of Global Optimization | 2009-07-13 | Paper |
The tricriterion shortest path problem with at least two bottleneck objective functions
European Journal of Operational Research | 2009-06-29 | Paper |
Reformulation in mathematical programming: An application to quantum chemistry
Discrete Applied Mathematics | 2009-06-23 | Paper |
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics | 2009-06-23 | Paper |
Editorial: Reformulation techniques in mathematical programming
Discrete Applied Mathematics | 2009-06-23 | Paper |
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
Optimization Letters | 2009-02-17 | Paper |
A New Neighborhood for the QAP
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
International Transactions in Operational Research | 2008-05-22 | Paper |
A note on characterizing canonical cuts using geometry
International Transactions in Operational Research | 2008-03-19 | Paper |
On the choice of parameters for the weighting method in vector optimization
Mathematical Programming. Series A. Series B | 2008-01-21 | Paper |
A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
European Journal of Operational Research | 2007-12-10 | Paper |
Computational Experience with the Molecular Distance Geometry Problem
Global Optimization | 2007-11-27 | Paper |
New formulations for the Kissing Number Problem
Discrete Applied Mathematics | 2007-09-19 | Paper |
The one dimensional Compartmentalised Knapsack problem: a case study
European Journal of Operational Research | 2007-08-27 | Paper |
The Kissing Number Problem: A New Result from Global Optimization
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms for finding minimum fundamental cycle bases in graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A column generation approach for SONET ring assignment
Networks | 2006-06-06 | Paper |
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics | 2006-04-28 | Paper |
B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
Annals of Operations Research | 2006-03-07 | Paper |
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
European Journal of Operational Research | 2005-04-21 | Paper |
Telecommunication network capacity design for uncertain demand
Computational Optimization and Applications | 2005-01-17 | Paper |
| scientific article; zbMATH DE number 2099401 (Why is no real title available?) | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2096645 (Why is no real title available?) | 2004-09-06 | Paper |
A greedy search for the three-dimensional bin packing problem: the packing static stability case
International Transactions in Operational Research | 2004-08-10 | Paper |
A function to test methods applied to global minimization of potential energy of molecules
Numerical Algorithms | 2004-08-10 | Paper |
Using a conic formulation for finding Steiner minimal trees
Numerical Algorithms | 2004-08-10 | Paper |
Stronger \(K\)-tree relaxations for the vehicle routing problem
European Journal of Operational Research | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2068065 (Why is no real title available?) | 2004-05-27 | Paper |
Column-Generation in Integer Linear Programming
RAIRO - Operations Research | 2004-02-15 | Paper |
Column-Generation in Integer Linear Programming
RAIRO - Operations Research | 2004-02-15 | Paper |
Column-Generation in Integer Linear Programming
RAIRO - Operations Research | 2004-02-15 | Paper |
A Boolean penalty method for zero-one nonlinear programming
Journal of Global Optimization | 2004-01-27 | Paper |
An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
Journal of Optimization Theory and Applications | 2003-10-29 | Paper |
| scientific article; zbMATH DE number 1941078 (Why is no real title available?) | 2003-06-29 | Paper |
Performance evaluation of a family of criss-cross algorithms for linear programming
International Transactions in Operational Research | 2003-06-23 | Paper |
| New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\) | 2003-03-12 | Paper |
Transient-states analysis of a 2-species dynamical ecological model via KCC-theory
Nonlinear Studies | 2002-12-02 | 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 |
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
RAIRO - Operations Research | 2002-08-18 | Paper |
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
RAIRO - Operations Research | 2002-08-18 | Paper |
| ILP formulations for scheduling ordered tasks on a bounded number of processors | 2001-10-24 | Paper |
A new formulation for scheduling unrelated processor under precedence constraints
RAIRO - Operations Research | 2001-04-19 | Paper |
A new formulation for scheduling unrelated processor under precedence constraints
RAIRO - Operations Research | 2001-04-19 | Paper |
The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
Annals of Operations Research | 2001-01-17 | Paper |
| Interval analysis applied to gobal minimization of potential energy functions. | 2001-01-01 | Paper |
Characterizing and edge-colouring split-indifference graphs
Discrete Applied Mathematics | 1998-06-02 | Paper |
A trust region method for zero-one nonlinear programming
RAIRO - Operations Research | 1998-01-21 | Paper |
A trust region method for zero-one nonlinear programming
RAIRO - Operations Research | 1998-01-21 | Paper |
A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
RAIRO - Operations Research | 1997-09-02 | Paper |
Lagrangean methods for 0-1 quadratic problems
Discrete Applied Mathematics | 1993-06-29 | Paper |
Lagrangean Decomposition In Integer Linear Programming: A New Scheme
INFOR: Information Systems and Operational Research | 1992-09-27 | Paper |
Lagrangean decomposition for integer nonlinear programming with linear constraints
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
An approach for the Steiner problem in directed graphs
Annals of Operations Research | 1992-06-27 | Paper |
A lower bound for the shortest Hamiltonean path in directed graphs
OR Spektrum | 1992-06-25 | Paper |
A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
Operations Research Letters | 1989-01-01 | Paper |
An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
RAIRO - Operations Research | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4089579 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4010182 (Why is no real title available?) | 1987-01-01 | Paper |
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
Discrete Applied Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4173002 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3856823 (Why is no real title available?) | 1984-01-01 | Paper |
Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1†
INFOR: Information Systems and Operational Research | 1983-01-01 | Paper |
The Administration of Standard Length Telephone Cable Reels
North-Holland Mathematics Studies | 1981-01-01 | Paper |
Graphs whose vertices of degree at least 2 lie in a triangle
(available as arXiv preprint) | N/A | Paper |
