| Publication | Date of Publication | Type |
|---|
A cut-and-branch algorithm for the external candidates examination scheduling problem
Journal of Scheduling | 2025-12-16 | Paper |
A new formulation for the traveling salesman problem with drone and lockers
Networks | 2025-09-01 | Paper |
| Optimization for surgery department management: an application to a hospital in Naples | 2024-10-16 | Paper |
A new MILP formulation for the flying sidekick traveling salesman problem
Networks | 2023-12-18 | Paper |
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
International Transactions in Operational Research | 2023-11-17 | Paper |
The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
European Journal of Operational Research | 2023-07-04 | Paper |
An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
Nonlinear Analysis. Hybrid Systems | 2022-04-08 | Paper |
Weak flow cover inequalities for the capacitated facility location problem
European Journal of Operational Research | 2021-06-03 | Paper |
Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
INFORMS Journal on Computing | 2021-02-01 | Paper |
Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
Computers & Operations Research | 2018-07-11 | Paper |
Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
Networks | 2018-05-23 | Paper |
A branch and cut heuristic for a runway scheduling problem
Automation and Remote Control | 2017-02-17 | Paper |
Lifted and local reachability cuts for the vehicle routing problem with time windows
Computers & Operations Research | 2016-11-10 | Paper |
An implementation of exact knapsack separation
Journal of Global Optimization | 2016-10-26 | Paper |
Computational testing of a separation procedure for the knapsack set with a single continuous variable
INFORMS Journal on Computing | 2016-06-29 | Paper |
The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
Networks | 2016-06-10 | Paper |
Polyhedral study of simple plant location problem with order
Operations Research Letters | 2013-05-14 | Paper |
An aggregation heuristic for large scale p-median problem
Computers & Operations Research | 2012-11-15 | Paper |
Near-optimal solutions of large-scale single-machine scheduling problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
A fast heuristic for a three-dimensional non-convex domain loading problem
4OR | 2011-05-25 | Paper |
A computational study of exact knapsack separation for the generalized assignment problem
Computational Optimization and Applications | 2010-04-28 | Paper |
An effective heuristic for large-scale capacitated facility location problems
Journal of Heuristics | 2009-12-11 | Paper |
A cutting plane algorithm for the capacitated facility location problem
Computational Optimization and Applications | 2009-09-25 | Paper |
Flow intercepting facility location: Problems, models and heuristics
JMMA. Journal of Mathematical Modelling and Algorithms | 2009-09-18 | Paper |
Computational experience with general cutting planes for the set covering problem
Operations Research Letters | 2009-02-23 | Paper |
A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-04-11 | Paper |
A branch-and-cut algorithm for the median-path problem
Computational Optimization and Applications | 2006-05-02 | Paper |
A decomposition approach for a very large scale optimal diversity management problem
4OR | 2005-08-25 | Paper |
Resource constrained shortest path problems in path planning for fleet management
JMMA. Journal of Mathematical Modelling and Algorithms | 2004-08-20 | Paper |
Solving a fuel delivery problem by heuristic and exact approaches.
European Journal of Operational Research | 2003-10-14 | Paper |
A penalty function heuristic for the resource constrained shortest path problem
European Journal of Operational Research | 2002-11-20 | Paper |
