Approaches to Integer Programming

Inhaltsverzeichnis

• Branch and bound experiments in zero-one programming.
• A subadditive approach to the group problem of integer programming.
• Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems.
• Lagrangean relaxation for integer programming.
• A heuristic algorithm for mixed-integer programming problems.
• On the group problem for mixed integer programming.
• Experiments in the formulation of integer programming problems.