Matteo Fischetti
Orcid: 0000-0001-6601-0568
According to our database1,
Matteo Fischetti
authored at least 132 papers
between 1987 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
1
1
1
2
1
1
3
6
6
6
1
3
2
5
3
4
4
4
5
4
2
1
3
2
3
5
3
2
4
1
4
2
3
3
2
1
4
2
1
1
1
1
1
1
3
1
3
1
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Manag. Sci., April, 2023
2022
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem.
Math. Program. Comput., 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Proceedings of the Optimization and Learning - 4th International Conference, 2021
2020
Eur. J. Oper. Res., 2020
2019
INFORMS J. Comput., 2019
2018
Eur. J. Oper. Res., 2018
Comput. Oper. Res., 2018
Constraints An Int. J., 2018
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018
2017
Math. Program. Comput., 2017
Manag. Sci., 2017
Oper. Res., 2017
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling.
Eur. J. Oper. Res., 2017
CoRR, 2017
2016
Math. Program. Comput., 2016
J. Heuristics, 2016
Benders decomposition without separability: A computational study for capacitated facility location problems.
Eur. J. Oper. Res., 2016
Discret. Optim., 2016
Comput. Optim. Appl., 2016
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
2015
Int. Trans. Oper. Res., 2015
2014
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014
2013
2012
Transp. Sci., 2012
Math. Program. Comput., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Math. Program. Comput., 2011
Math. Program., 2011
2010
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010
Math. Program., 2010
Electron. Notes Discret. Math., 2010
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010
2009
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Math. Program., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008
ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008
2007
INFORMS J. Comput., 2007
Discret. Optim., 2007
2006
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006
Math. Program., 2006
Discret. Optim., 2006
2005
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem.
Networks, 2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Stat. Comput., 2003
Eur. J. Oper. Res., 2003
2002
2001
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.
Math. Program., 2001
Manag. Sci., 2001
Manag. Sci., 2001
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001
Proceedings of the Combinatorial Optimization, 2001
2000
Networks, 2000
Eur. J. Oper. Res., 2000
Discret. Appl. Math., 2000
Proceedings of the 33rd Annual Hawaii International Conference on System Sciences (HICSS-33), 2000
1999
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control.
Math. Program., 1999
Math. Oper. Res., 1999
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
1997
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks, 1997
Oper. Res., 1997
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design.
IEEE Trans. Knowl. Data Eng., 1995
Math. Program., 1995
Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope.
Discret. Appl. Math., 1995
1994
Networks, 1994
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res., 1994
1993
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets.
Math. Program., 1993
INFORMS J. Comput., 1993
1992
Math. Program., 1992
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
1990
A new linear storage, polynomial-time approximation scheme for the subset-sum problem.
Discret. Appl. Math., 1990
1989
Networks, 1989
Oper. Res., 1989
1987
Math. Program., 1987