| Publication | Date of Publication | Type |
|---|
A compact formulation for the base station deployment problem in wireless networks
Networks | 2023-12-18 | Paper |
| Power Reduction in FM Networks by Mixed-Integer Programming. A Case Study | 2023-10-30 | Paper |
| A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems | 2023-03-07 | Paper |
Weak flow cover inequalities for the capacitated facility location problem
European Journal of Operational Research | 2021-06-03 | 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 |
Computational testing of a separation procedure for the knapsack set with a single continuous variable
INFORMS Journal on Computing | 2016-06-29 | 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 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 |
Computational experience with general cutting planes for the set covering problem
Operations Research Letters | 2009-02-23 | Paper |
A computational study of local search algorithms for Italian high-school timetabling
Journal of Heuristics | 2008-06-23 | Paper |
Metric inequalities and the network loading problem
Discrete Optimization | 2008-02-22 | Paper |
A computational study of a cutting plane algorithm for university course timetabling
Journal of Scheduling | 2007-05-15 | Paper |
Computational study of large-scale \(p\)-median problems
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
A LP-based heuristic for a time-constrained routing problem
European Journal of Operational Research | 2006-05-29 | Paper |
A branch-and-cut algorithm for the median-path problem
Computational Optimization and Applications | 2006-05-02 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2230234 (Why is no real title available?) | 2005-11-18 | Paper |
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
European Journal of Operational Research | 2005-09-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 |
On the \(p\)-median polytope
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
Logical reduction tests for the p-problem
Annals of Operations Research | 1999-06-10 | Paper |
