A Feasibility Pump Heuristic for General Mixed-Integer Problems,’’ Discrete Optimization 4 (2007)
Livio Bertacco, Matteo Fischetti, Andrea Lodi
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fischetti, Glover and...
The Linear Ordering Problem with cumulative costs
Bertacco, Livio, Brunetta, Lorenzo, Fischetti, Matteo
The optimization problem of finding a permutation of a given set of items that minimizes a certain cost function is naturally modeled by introducing a complete digraph G whose vertices correspond to...