Search Results - "Fischetti, Matteo"

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem by Cavaliere, Francesco, Bendotti, Emilio, Fischetti, Matteo

“…In this paper, an effective heuristic algorithm for large-scale instances of the Capacitated Vehicle Routing Problem is proposed. The technique consists in a…”
Get full text

Fast Approaches to Improve the Robustness of a Railway Timetable by Fischetti, Matteo, Salvagnin, Domenico, Zanette, Arrigo

“…The train timetabling problem (TTP) consists of finding a train schedule on a railway network that satisfies some operational constraints and maximizes some…”
Get full text

Cutting plane versus compact formulations for uncertain (integer) linear programs by Fischetti, Matteo, Monaci, Michele

“…Robustness is about reducing the feasible set of a given nominal optimization problem by cutting “risky” solutions away. To this end, the most popular approach…”
Get full text

Modeling and Solving the Train Timetabling Problem by Caprara, Alberto, Fischetti, Matteo, Toth, Paolo

“…The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some…”
Get full text

Lexicography and degeneracy: can a pure cutting plane algorithm work? by Zanette, Arrigo, Fischetti, Matteo, Balas, Egon

“…We discuss an implementation of the lexicographic version of Gomory’s fractional cutting plane method for ILP problems and of two heuristics mimicking the…”
Get full text

A Heuristic Method for the Set Covering Problem by Caprara, Alberto, Fischetti, Matteo, Toth, Paolo

“…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…”
Get full text

An algorithmic framework for the exact solution of the prize-collecting steiner tree problem by LJUBIC, Ivana, WEISKIRCHER, René, PFERSCHY, Ulrich, KLAU, Gunnar W, MUTZEL, Petra, FISCHETTI, Matteo

“…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…”
Get full text

MIP-and-refine matheuristic for smart grid energy management by Fischetti, Matteo, Sartor, Giorgio, Zanette, Arrigo

“…In the past years, we have witnessed an increasing interest in smart buildings, in particular for optimal energy management, renewable energy sources, and…”
Get full text

A new ILP-based refinement heuristic for Vehicle Routing Problems by DE FRANCESCHI, Roberto, FISCHETTI, Matteo, TOTH, Paolo

“…In this paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be…”
Get full text

Deep neural networks and mixed integer linear optimization by Fischetti, Matteo, Jo, Jason

“…Deep Neural Networks (DNNs) are very popular these days, and are the subject of a very intense investigation. A DNN is made up of layers of internal units (or…”
Get full text

A branch-and-cut algorithm for Mixed-Integer Bilinear Programming by Fischetti, Matteo, Monaci, Michele

“…•We consider the Mixed-Integer Bilinear Programming problem.•We design an exact branch-and-cut algorithm, based on a new branching rule.•A new family of…”
Get full text

Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling by Fischetti, Matteo, Monaci, Michele

“…•We propose an effective heuristic for real-time train rescheduling.•The heuristic uses a general-purpose Mixed-Integer Linear Programming solver.•Randomized…”
Get full text

Integrated Layout and Cable Routing in Wind Farm Optimal Design by Fischetti, Martina, Fischetti, Matteo

“…We address a very important problem in offshore wind farm design, namely, the combined optimization of the turbine location and of the connection cables…”
Get full text

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming by Codato, Gianni, Fischetti, Matteo

“…Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we…”
Get full text

Fast training of Support Vector Machines with Gaussian kernel by Fischetti, Matteo

“…Support Vector Machines (SVM’s) are ubiquitous and attracted a huge interest in the last years. Their training involves the definition of a suitable…”
Get full text

Exploiting Erraticism in Search by Fischetti, Matteo, Monaci, Michele

“…High sensitivity to initial conditions is generally viewed as a drawback of tree search methods because it leads to erratic behavior to be mitigated somehow…”
Get full text

Redesigning Benders Decomposition for Large-Scale Facility Location by Fischetti, Matteo, Ljubić, Ivana, Sinnl, Markus

“…The uncapacitated facility location (UFL) problem is one of the most famous and most studied problems in the operations research literature. Given a set of…”
Get full text

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs by Fischetti, Matteo, Ljubić, Ivana, Monaci, Michele, Sinnl, Markus

“…Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy…”
Get full text

Safe distancing in the time of COVID-19 by Fischetti, Martina, Fischetti, Matteo, Stoustrup, Jakob

“…•We study a facility layout problem under social distancing constraints.•Our goal is to find layouts that minimize the overall risk of COVID-19…”
Get full text

Proximity search for 0-1 mixed-integer convex programming by Fischetti, Matteo, Monaci, Michele

“…In this paper we investigate the effects of replacing the objective function of a 0-1 mixed-integer convex program (MIP) with a “proximity” one, with the aim…”
Get full text