| Publication | Date of Publication | Type |
|---|
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
INFORMS Journal on Computing | 2021-06-23 | Paper |
Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques
Computers & Operations Research | 2021-04-20 | Paper |
Suppliers selection problem with quantity discounts and price changes: A heuristic approach
RAIRO - Operations Research | 2019-11-06 | Paper |
A computational comparison of compact MILP formulations for the zero forcing number
Discrete Applied Mathematics | 2019-10-09 | Paper |
Comparing techniques for modelling uncertainty in a maritime inventory routing problem
European Journal of Operational Research | 2019-04-30 | Paper |
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
Networks | 2018-10-11 | Paper |
A decomposition approach for the \(p\)-median problem on disconnected graphs
Computers & Operations Research | 2018-07-11 | Paper |
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
European Journal of Operational Research | 2018-05-24 | Paper |
A hybrid heuristic for a stochastic production-inventory-routing problem
| 2018-04-11 | Paper |
Feasibility check for the distance geometry problem: an application to molecular conformations
International Transactions in Operational Research | 2017-10-02 | Paper |
The robust vehicle routing problem with time windows
Computers & Operations Research | 2016-11-14 | Paper |
Implicit cover inequalities
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
Using decomposition to improve greedy solutions of the optimal diversity management problem
International Transactions in Operational Research | 2013-11-14 | Paper |
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
Lecture Notes in Computer Science | 2012-11-02 | Paper |
On the weight-constrained minimum spanning tree problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Greedy heuristics for the diameter-constrained minimum spanning tree problem
Journal of Mathematical Sciences (New York) | 2010-01-19 | Paper |
The linking set problem: a polynomial special case of the multiple-choice knapsack problem
Journal of Mathematical Sciences (New York) | 2010-01-19 | Paper |
Extended formulations for the cardinality constrained subtree of a tree problem
Operations Research Letters | 2009-08-14 | Paper |
On formulations and methods for the hop-constrained minimum spanning tree problem
| 2007-07-23 | Paper |
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
Annals of Operations Research | 2007-02-05 | Paper |
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
Networks | 2005-01-12 | Paper |
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
European Journal of Operational Research | 2001-01-01 | Paper |
A block active set algorithm for large-scale quadratic programming with box constraints
Annals of Operations Research | 1998-09-27 | Paper |
