Works matching AU Fischetti, Matteo

Results: 68

Solving the Cell Suppression Problem on Tabular Data with Linear Constraints.

Published in:

Management Science, 2001, v. 47, n. 7, p. 1008, doi. 10.1287/mnsc.47.7.1008.9805

By:

Fischetti, Matteo;
Salazar, Juan José

Publication type:

Article

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.

Published in:

Management Science, 2001, v. 47, n. 6, p. 833, doi. 10.1287/mnsc.47.6.833.9810

By:

Fischetti, Matteo;
Lodi, Andrea;
Martello, Silvano;
Toth, Paolo

Publication type:

Article

A Polyhedral Approach to the Asymmetric Traveling Salesman Problem.

Published in:

Management Science, 1997, v. 43, n. 11, p. 1520, doi. 10.1287/mnsc.43.11.1520

By:

Fischetti, Matteo;
Toth, Paolo

Publication type:

Article

Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem.

Published in:

Management Science, 1993, v. 39, n. 1, p. 115, doi. 10.1287/mnsc.39.1.115

By:

Dell'Amico, Mauro;
Fischetti, Matteo;
Toth, Paolo

Publication type:

Article

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.

Published in:

Operations Research, 2017, v. 65, n. 6, p. 1615, doi. 10.1287/opre.2017.1650

By:

Fischetti, Matteo;
Ljubić, Ivana;
Monaci, Michele;
Sinnl, Markus

Publication type:

Article

Exploiting Erraticism in Search.

Published in:

Operations Research, 2014, v. 62, n. 1, p. 114, doi. 10.1287/opre.2013.1231

By:

Fischetti, Matteo;
Monaci, Michele

Publication type:

Article

Three Ideas for the Quadratic Assignment Problem.

Published in:

Operations Research, 2012, v. 60, n. 4, p. 954, doi. 10.1287/opre.1120.1073

By:

Fischetti, Matteo;
Monaci, Michele;
Salvagnin, Domenico

Publication type:

Article

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming.

Published in:

Operations Research, 2006, v. 54, n. 4, p. 756, doi. 10.1287/opre.1060.0286

By:

Codato, Gianni;
Fischetti, Matteo

Publication type:

Article

MODELING AND SOLVING THE TRAIN TIMETABLING PROBLEM.

Published in:

Operations Research, 2002, v. 50, n. 5, p. 851, doi. 10.1287/opre.50.5.851.362

By:

Caprara, Alberto;
Fischetti, Matteo;
Toth, Paolo

Publication type:

Article

Development and Implementation of a Machine to Increase the Production and the Quality of a Compost.

Published in:

Recycling (MDPI AG), 2025, v. 10, n. 2, p. 62, doi. 10.3390/recycling10020062

By:

Mori de Oliveira, Camila;
Sammito, Andrea;
Boano, Mauro;
Fischetti, Matteo;
Toso, Lorenzo;
Pizio, Roberta;
Bellopede, Rossana;
Marini, Paola

Publication type:

Article

On handling indicator constraints in mixed integer programming.

Published in:

Computational Optimization & Applications, 2016, v. 65, n. 3, p. 545, doi. 10.1007/s10589-016-9847-8

By:

Belotti, Pietro;
Bonami, Pierre;
Fischetti, Matteo;
Lodi, Andrea;
Monaci, Michele;
Nogales-Gómez, Amaya;
Salvagnin, Domenico

Publication type:

Article

Algorithms for the Set Covering Problem.

Published in:

Annals of Operations Research, 2000, v. 98, n. 1-4, p. 353, doi. 10.1023/A:1019225027893

By:

Caprara, Alberto;
Toth, Paolo;
Fischetti, Matteo

Publication type:

Article

Models and Algorithms for Optimizing Cell Suppression in Tabular Data With Linear Constraints.

Published in:

Journal of the American Statistical Association, 2000, v. 95, n. 451, p. 916, doi. 10.1080/01621459.2000.10474282

By:

Fischetti, Matteo;
Salazar Gonzalez, Juan Jose

Publication type:

Article

On the use of intersection cuts for bilevel optimization.

Published in:

Mathematical Programming, 2018, v. 172, n. 1/2, p. 77, doi. 10.1007/s10107-017-1189-5

By:

Fischetti, Matteo;
Ljubić, Ivana;
Monaci, Michele;
Sinnl, Markus

Publication type:

Article

Least cost influence propagation in (social) networks.

Published in:

Mathematical Programming, 2018, v. 170, n. 1, p. 293, doi. 10.1007/s10107-018-1288-y

By:

Fischetti, Matteo;
Kahr, Michael;
Leitner, Markus;
Monaci, Michele;
Ruthmair, Mario

Publication type:

Article

A hard integer program made easy by lexicography.

Published in:

Mathematical Programming, 2012, v. 135, n. 1/2, p. 509, doi. 10.1007/s10107-011-0450-6

By:

Balas, Egon;
Fischetti, Matteo;
Zanette, Arrigo

Publication type:

Article

Lexicography and degeneracy: can a pure cutting plane algorithm work?

Published in:

Mathematical Programming, 2011, v. 130, n. 1, p. 153, doi. 10.1007/s10107-009-0335-0

By:

Zanette, Arrigo;
Fischetti, Matteo;
Balas, Egon

Publication type:

Article

On the separation of disjunctive cuts.

Published in:

Mathematical Programming, 2011, v. 128, n. 1/2, p. 205, doi. 10.1007/s10107-009-0300-y

By:

Fischetti, Matteo;
Lodi, Andrea;
Tramontani, Andrea

Publication type:

Article

On the enumerative nature of Gomory's dual cutting plane method.

Published in:

Mathematical Programming, 2010, v. 125, n. 2, p. 325, doi. 10.1007/s10107-010-0392-4

By:

Balas, Egon;
Fischetti, Matteo;
Zanette, Arrigo

Publication type:

Article

A note on the selection of Benders’ cuts.

Published in:

Mathematical Programming, 2010, v. 124, n. 1/2, p. 175, doi. 10.1007/s10107-010-0365-7

By:

Fischetti, Matteo;
Salvagnin, Domenico;
Zanette, Arrigo

Publication type:

Article

Projected Chvátal–Gomory cuts for mixed integer linear programs.

Published in:

Mathematical Programming, 2008, v. 113, n. 2, p. 241, doi. 10.1007/s10107-006-0051-y

By:

Bonami, Pierre;
Cornuéjols, Gérard;
Dash, Sanjeeb;
Fischetti, Matteo;
Lodi, Andrea

Publication type:

Article

Optimizing over the first Chvátal closure.

Published in:

Mathematical Programming, 2007, v. 110, n. 1, p. 3, doi. 10.1007/s10107-006-0054-8

By:

Fischetti, Matteo;
Lodi, Andrea

Publication type:

Article

Mixed-Integer Cuts from Cyclic Groups.

Published in:

Mathematical Programming, 2007, v. 109, n. 1, p. 27, doi. 10.1007/s10107-006-0726-4

By:

Fischetti, Matteo;
Saturni, Cristiano

Publication type:

Article

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.

Published in:

Mathematical Programming, 2006, v. 105, n. 2/3, p. 427, doi. 10.1007/s10107-005-0660-x

By:

Ljubić, Ivana;
Weiskircher, René;
Pferschy, Ulrich;
Klau, Gunnar W.;
Mutzel, Petra;
Fischetti, Matteo

Publication type:

Article

A new ILP-based refinement heuristic for Vehicle Routing Problems.

Published in:

Mathematical Programming, 2006, v. 105, n. 2/3, p. 471, doi. 10.1007/s10107-005-0662-8

By:

Franceschi, Roberto De;
Fischetti, Matteo;
Toth, Paolo

Publication type:

Article

The feasibility pump.

Published in:

Mathematical Programming, 2005, v. 104, n. 1, p. 91, doi. 10.1007/s10107-004-0570-3

By:

Fischetti, Matteo;
Glover, Fred;
Lodi, Andrea

Publication type:

Article

Local branching.

Published in:

Mathematical Programming, 2003, v. 98, n. 1-3, p. 23, doi. 10.1007/s10107-003-0395-5

By:

Fischetti, Matteo;
Lodi, Andrea

Publication type:

Article

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.

Published in:

Mathematical Programming, 2001, v. 90, n. 3, p. 475, doi. 10.1007/PL00011432

By:

Ascheuer, Norbert;
Fischetti, Matteo;
Grötschel, Martin

Publication type:

Article

On the separation of maximally violated mod-k cuts.

Published in:

Mathematical Programming, 2000, v. 87, n. 1, p. 37, doi. 10.1007/s101079900107

By:

Caprara, Alberto;
Fischetti, Matteo;
Letchford, Adam N.

Publication type:

Article

Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control.

Published in:

Mathematical Programming, 1999, v. 84, n. 2, p. 283, doi. 10.1007/s10107980022a

By:

Fischetti, Matteo;
Salazar, Juan José

Publication type:

Article

A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem.

Published in:

Networks, 2004, v. 44, n. 2, p. 61, doi. 10.1002/net.20017

By:

Fischetti, Matteo;
Polo, Carlo;
Scantamburlo, Massimo

Publication type:

Article

Exact algorithms for minimum routing cost trees.

Published in:

Networks, 2002, v. 39, n. 3, p. 161, doi. 10.1002/net.10022

By:

Fischetti, Matteo;
Lancia, Giuseppe;
Serafini, Paolo

Publication type:

Article

A polyhedral study of the asymmetric traveling salesman problem with time windows.

Published in:

Networks, 2000, v. 36, n. 2, p. 69, doi. 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q

By:

Ascheuer, Norbert;
Fischetti, Matteo;
Grötschel, Martin

Publication type:

Article

A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.

Published in:

Networks, 1997, v. 29, n. 1, p. 55, doi. 10.1002/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-B

By:

Fischetti, Matteo;
Vigo, Daniele

Publication type:

Article

The symmetric generalized traveling salesman polytope.

Published in:

Networks, 1995, v. 26, n. 2, p. 113, doi. 10.1002/net.3230260206

By:

Fischetti, Matteo;
González, Juan José Salazar;
Toth, Paolo

Publication type:

Article

Weighted k-cardinality trees: Complexity and polyhedral structure.

Published in:

Networks, 1994, v. 24, n. 1, p. 11, doi. 10.1002/net.3230240103

By:

Fischetti, Matteo;
Hamacher, Horst W.;
Jørnsten, Kurt;
Maffioli, Francesco

Publication type:

Article

A HYBRID ALGORITHM FOR FINDING THE kTH SMALLEST OF n ELEMENTS IN O(n) TIME.

Published in:

Annals of Operations Research, 1988, v. 13, n. 1-4, p. 401, doi. 10.1007/BF02288326

By:

Fischetti, Matteo;
Martello, Silvano

Publication type:

Article

Proximity Benders: a decomposition heuristic for stochastic programs.

Published in:

Journal of Heuristics, 2016, v. 22, n. 2, p. 181, doi. 10.1007/s10732-015-9306-1

By:

Boland, Natashia;
Fischetti, Matteo;
Monaci, Michele;
Savelsbergh, Martin

Publication type:

Article

Proximity search for 0-1 mixed-integer convex programming.

Published in:

Journal of Heuristics, 2014, v. 20, n. 6, p. 709, doi. 10.1007/s10732-014-9266-x

By:

Fischetti, Matteo;
Monaci, Michele

Publication type:

Article

Mixed-integer programming models for nesting problems.

Published in:

Journal of Heuristics, 2009, v. 15, n. 3, p. 201, doi. 10.1007/s10732-008-9088-9

By:

Fischetti, Matteo;
Luzzi, Ivan

Publication type:

Article

MIPping Closures: An Instant Survey.

Published in:

Graphs & Combinatorics, 2007, v. 23, p. 233, doi. 10.1007/s00373-007-0711-6

By:

Fischetti, Matteo;
Lodi, Andrea

Publication type:

Article

LIFTED CYCLE INEQUALITIES FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM.

Published in:

Mathematics of Operations Research, 1999, v. 24, n. 2, p. 273, doi. 10.1287/moor.24.2.273

By:

Balas, Egon;
Fischetti, Matteo

Publication type:

Article

THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE.

Published in:

Mathematics of Operations Research, 1992, v. 17, n. 4, p. 1001, doi. 10.1287/moor.17.4.1001

By:

Balas, Egon;
Fischetti, Matteo

Publication type:

Article

FACETS OF THE ASYMMETRICAL TRAVELING SALESMAN POLYTOPE.

Published in:

Mathematics of Operations Research, 1991, v. 16, n. 1, p. 42, doi. 10.1287/moor.16.1.42

By:

Fischetti, Matteo

Publication type:

Article

Integrated Layout and Cable Routing in Wind Farm Optimal Design.

Published in:

Management Science, 2023, v. 69, n. 4, p. 2147, doi. 10.1287/mnsc.2022.4470

By:

Fischetti, Martina;
Fischetti, Matteo

Publication type:

Article

Redesigning Benders Decomposition for Large-Scale Facility Location.

Published in:

Management Science, 2017, v. 63, n. 7, p. 2146, doi. 10.1287/mnsc.2016.2461

By:

Fischetti, Matteo;
Ljubić, Ivana;
Sinnl, Markus

Publication type:

Article

The New Dutch Timetable: The OR Revolution.

Published in:

Interfaces, 2009, v. 39, n. 1, p. 6, doi. 10.1287/inte.1080.0409

By:

Kroon, Leo;
Huisman, Dennis;
Abbink, Erwin;
Fioole, Pieter-Jan;
Fischetti, Matteo;
Maróti, Gábor;
Schrijver, Alexander;
Steenbeek, Adri;
Ybema, Roelof

Publication type:

Article

Reinventing Crew Scheduling at Netherlands Railways.

Published in:

Interfaces, 2005, v. 35, n. 5, p. 393, doi. 10.1287/inte.1050.0158

By:

Abbink, Erwin;
Fischetti, Matteo;
Kroon, Leo;
Timmer, Gerrit;
Vromans, Michiel

Publication type:

Article

MIP-and-refine matheuristic for smart grid energy management.

Published in:

International Transactions in Operational Research, 2015, v. 22, n. 1, p. 49, doi. 10.1111/itor.12034

By:

Fischetti, Matteo;
Sartor, Giorgio;
Zanette, Arrigo

Publication type:

Article

An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.

Published in:

ORSA Journal on Computing, 1993, v. 5, n. 4, p. 426, doi. 10.1287/ijoc.5.4.426

By:

Fischetti, Matteo;
Toth, Paolo

Publication type:

Article