Solving integer programs with a few important binary gub constraints

Abstract

During a branch and bound search of an integer program, decisions have to be taken about which subproblem to solve next and which variable or special ordered set to branch on. Both these decisions are usually based on some sort of estimated change in the objective caused by different branching. When the next subproblem is chosen, the estimated change in the… (More)
DOI: 10.1007/BF02024842

Topics

3 Figures and Tables

Slides referencing similar topics