Publication Details
Title: A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem
Author: E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller
Group: Algorithms
Date: 2000
PDF: [Not available online]
Bibliographic Information:
Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000.
Bibliographic Reference:
E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller. A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem. Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000., 2000
Author: E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller
Group: Algorithms
Date: 2000
PDF: [Not available online]
Bibliographic Information:
Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000.
Bibliographic Reference:
E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller. A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem. Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000., 2000