Commit 5c9911c9 authored by MIPLIB Submitter's avatar MIPLIB Submitter

New submission at 2017-02-24 18:47:25.823443

parent ac6ac20a
company: University of Modena and Reggio Emilia, Italy
creator: Jean-François Côté
description: The models that we attach solve the "bar-relaxation", also known as the
"Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is
one of the most interesting relaxations for two dimensional cutting and packing
problems. Its solution by means of an ILP software is the bottleneck of the primal
decomposition methods that we attempted in the paper cited below. In detail, the
files correspond to model (12)-(15) in the paper, applied to the instances of the
Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998).
license: cc-license
misc: ''
name: Manuel Iori
other-license: ''
owner: Jean-François Côté, Manuel Iori
AUTHOR = "C{\^o}t{\'e}, J.-F. and Dell'Amico, M. and Iori, M.",
TITLE = "Combinatorial {B}enders' Cuts for the Strip Packing Problem",
JOURNAL = "Operations Research",
YEAR = 2014,
VOLUME = 62,
PAGES = "643--661"
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment