COIN-OR::LEMON - Graph Library

Changes between Version 13 and Version 14 of AlkMod2017


Ignore:
Timestamp:
11/08/17 12:24:32 (5 weeks ago)
Author:
alpar
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • AlkMod2017

    v13 v14  
    1111We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e. implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree. We present classes of models for which this approach decomposes the problem, provides tighter LP relaxations and eliminates symmetry. We then discuss computational issues and implementation of column generation, branch-and-bound algorithms, including special branching rules and effient ways to solve the LP relaxation. 
    1212 
    13 == November 22. == 
     13== November 22. --- Hegel Patrik == 
    1414 
    1515[attachment:a02v29n2.pdf​ D. P. Ronconi and M. S. Kawamura. ''The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm'']