Carlo Filippi

According to our database1, Carlo Filippi authored at least 23 papers between 1996 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On single-source capacitated facility location with cost and fairness objectives.
Eur. J. Oper. Res., 2021

A kernel search heuristic for a fair facility location problem.
Comput. Oper. Res., 2021

2020
Conditional value-at-risk beyond finance: a survey.
Int. Trans. Oper. Res., 2020

2019
Bridging <i>k</i>-sum and CVaR optimization in MILP.
Comput. Oper. Res., 2019

2017
Mixed integer linear programming models for optimal crop selection.
Comput. Oper. Res., 2017

The probabilistic orienteering problem.
Comput. Oper. Res., 2017

2014
Optimal interval scheduling with a resource constraint.
Comput. Oper. Res., 2014

2013
Balancing profits and costs on trees.
Networks, 2013

Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits.
Comput. Oper. Res., 2013

2012
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits.
Algorithmic Oper. Res., 2012

2011
On the complexity of interval scheduling with a resource constraint.
Theor. Comput. Sci., 2011

2010
An approximate algorithm for a high-multiplicity parallel machine scheduling problem.
Oper. Res. Lett., 2010

2009
Exact and approximate algorithms for high-multiplicity parallel machine scheduling.
J. Sched., 2009

2007
On the bin packing problem with a fixed number of object weights.
Eur. J. Oper. Res., 2007

2006
Robust explicit MPC based on approximate multiparametric convex programming.
IEEE Trans. Autom. Control., 2006

A variable neighborhood descent algorithm for a real waste collection problem with mobile depots.
Int. Trans. Oper. Res., 2006

An Algorithm for Approximate Multiparametric Convex Programming.
Comput. Optim. Appl., 2006

2005
An asymptotically exact algorithm for the high-multiplicity bin packing problem.
Math. Program., 2005

A fresh view on the tolerance approach to sensitivity analysis in linear programming.
Eur. J. Oper. Res., 2005

2004
Inner and outer approximations of polytopes using boxes.
Comput. Geom., 2004

2002
Multiparametric demand transportation problem.
Eur. J. Oper. Res., 2002

1999
A reverse search algorithm for the neighborhood problem.
Oper. Res. Lett., 1999

1996
Optimal Allocation of Two Fixed Service Units Acting as <i>M</i>/<i>G</i>/1 Queues.
Transp. Sci., 1996


  Loading...