Copyright (C) 2013, Filipe Brandao Faculdade de Ciencias, Universidade do Porto Porto, Portugal. All rights reserved. E-mail: . 0-1CSP solver based on an arc-flow formulation with graph compression. -- Proposed in: Brandão, F. and Pedroso, J. P. (2013). Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression. Technical Report DCC-2013-09, Faculdade de Ciências da Universidade do Porto, Universidade do Porto, Portugal. -- Requires Gurobi to solve MIP models. -- Components: - bin/solver - solves 0-1CSP instances using the arc-flow approach - bin/gg_afg - computes the linear relaxation using Gilmore-Gomory's column generation approach (solving the knapsack sub-problems using the arc-flow graph) - bin/gg_dp - computes the linear relaxation using Gilmore-Gomory's column generation approach (solving the knapsack sub-problems using dynamic programming) - bin/gg_grp - computes the linear relaxation using Gilmore-Gomory's column generation approach (solving the knapsack sub-problems using a MIP model) -- Filipe Brandao's Homepage: http://www.dcc.fc.up.pt/~fdabrandao/