A complete description of the instances is given in:
Heuristic and MetaheuristicApproaches for a Class of Two-Dimensional Bin Packing Problems
Lodi, Martello, Vigo, INFORMS, Journal on Computing
The code description is given in:
TSpack: a unified Tabu Search code for Muti-Dimensional Bin Packing Problems
by Lodi, Martello, Vigo - Technical Report OR/02/3, DEIS
TSpack: a unified Tabu Search code for Muti-Dimensional Bin Packing Problems - REVISED VERSION
by Lodi, Martello, Vigo - Technical Report OR/02/3, DEIS
Parameter file used for solving SDPs with use of SDPA
Instances used in the paper "Solving Standard Quadratic Programming by Cutting Planes" by Pierre Bonami, Andrea Lodi, Jonas Schweiger, and Andrea Tramontani.
This page contains the instances used for the computational experimental phase of the manuscript "Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem" by L. Galli, S. Martello, C. Rey, and P. Toth. (2021). European Journal of Operational Research, 291(3), 871-882.
These instances have been used in
Claudia D'ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi
"On the Product Knapsack Problem"
Selected instances considered in "Packing into the Smallest Square: Worst-Case Analysys of Lower Bounds" (Caprara, Lodi, Martello, Monaci, 2006)
Complete set of instances considered in "Models and Algorithms for Packing Rectangles into the Smallest Square" (Martello, Monaci, 2014)
This page is the main support of the paper "Logic Based Benders' Decomposition for Orthogonal Stock Cutting Problem" by M. Delorme, M. Iori, and S. Martello, Computers & Operations Research, 78:290-298, 2016.
In this page are gathered the instances that were used for the computational experiments section for the orthogonal Stock Cutting Problem (SCP), the Packing Squares into a Square problem (PSS), the Packing Rectangles into a Square with Rotation problem (PRSR), and the Pallet Loading Problem (PLP).
These are the instances tested in:
Lower and upper bounds for the non-linear generalized assignment problem
by Claudia D’Ambrosio, Silvano Martello, and Michele Monaci
This page is the main support of the manuscript "Mathematical models and decomposition methods for the multiple knapsack problem" by M. Dell'Amico, M. Delorme, M. Iori, and S. Martello, OR-18-1, 2018.
In this page are gathered the instances that were used for the computational experiments section for the Multiple Knapsack Problem (MKP).
A complete description of the instances is given in:
A Branch-and-Cut Algorithm for the MD-VSP
M. Fischetti, A. Lodi, P. Toth
while the final reasearch paper is:
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
M. Fischetti, A. Lodi, S. Martello, P. Toth, to appear in Management Science
M. Fischetti, A. Lodi
Instances proposed in "A dynamic programming algorithm for the knapsack problem with setup (K. Chebiland, M. Khemakhem. Computers & Operations Research, 2015).
Instances proposed in "An exact approach for the 0-1 knapsack problem with setups (F. Della Croce, F. Salassa, R. Scatamacchia. Computers & Operations Research, 2017).
Instances proposed in "Exact approaches for the Knapsack Problem with Setups (F. Furini, M. Monaci, E. Traversi. Tech-Report, Lamsade, Université Paris Dauphine, 2017) and associated computational results.
Instances proposed in "Exact approaches for the Knapsack Problem with Setups (F. Furini, M. Monaci, E. Traversi. Tech-Report, Lamsade, Université Paris Dauphine, 2017) and associated computational results.
The description of the algorithms is given in:
- The Feasibility Pump
by M. Fischetti, F. Glover, A. Lodi - Mathematical Programming 104, 91-104, 20
- A Feasibility Pump heuristic for general Mixed-Integer Problems
by L. Bertacco, M. Fischetti, A. Lodi - Technical Report OR/05/5, DEIS
- Improving the Feasibility Pump
by T. Achterberg, T. Berthold - technical report ZR-05-42, ZIB