#### Filter Results:

- Full text PDF available (82)

#### Publication Year

1963

2018

- This year (6)
- Last 5 years (29)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Matteo Fischetti, Andrea Lodi
- Math. Program.
- 2003

Abstract. The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper weâ€¦ (More)

- Matteo Fischetti, Juan JosÃ© Salazar GonzÃ¡lez, Paolo Toth
- Operations Research
- 1997

Symmetri Generalized Travelling Salesman Problem Matteo Fis hetti Juan Jos e Salazar Gonz alezy Paolo Tothz January 1994; Revised May 1995 Abstra t We onsider a variant of the lassi al symmetriâ€¦ (More)

- Alberto Caprara, Matteo Fischetti, Paolo Toth
- Operations Research
- 1999

We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows andâ€¦ (More)

- Norbert Ascheuer, Matteo Fischetti, Martin GrÃ¶tschel
- Math. Program.
- 2001

Many optimization problems have several equivalent mathematical models. It is often not apparent which of these models is most suitable for practical computation, in particular, when a certainâ€¦ (More)

- Matteo Fischetti, Fred Glover, Andrea Lodi
- Math. Program.
- 2005

In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min{cT x : Ax â‰¥ b, xj integer âˆ€j âˆˆ I}. Trivially, a feasibleâ€¦ (More)

- Matteo Fischetti, Andrea Lodi
- IPCO
- 2005

How difficult is, in practice, to optimize exactly over the first ChvÃ¡tal closure of a generic ILP? Which fraction of the integrality gap can be closed this way, e.g., for some hard problems in theâ€¦ (More)

- Norbert Ascheuer, Matteo Fischetti, Martin GrÃ¶tschel
- Networks
- 2000

The asymmetric traveling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper, we present a formulation of the problem involving onlyâ€¦ (More)

- Egon Balas, Matteo Fischetti, William R. Pulleyblank
- Math. Program.
- 1995

- Ivana Ljubic, RenÃ© Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
- Math. Program.
- 2006

The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the totalâ€¦ (More)

- Matteo Fischetti, Horst W. Hamacher, Kurt JÃ¶rnsten, Francesco Maffioli
- Networks
- 1994

We consider the k-CARD TREE problem, i.e., the problem of finding in a given undirected graph G a subtree with kedges, having minimum weight. Applications of this problem arise in oil-field leasingâ€¦ (More)