<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05829078</id>
  <dt>a</dt>
  <an>05829078</an>
  <augroup>
    <au>Achterberg, Tobias</au>
    <au>Lodi, Andrea</au>
  </augroup>
  <ti>Hybrid solving techniques.</ti>
  <so>Milano, Michela (ed.) et al., Hybrid optimization. The ten years of CPAIOR. New York, NY: Springer (ISBN 978-1-4419-1643-3/hbk; 978-1-4419-1644-0/ebook). Springer Optimization and Its Applications 45, 169-190 (2011).</so>
  <py>2011</py>
  <pu>New York, NY: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-1-4419-1644-0_5</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Hybrid methods have always been one of the most intriguing directions in the 10--15 years spent in creating and enhancing the relationship between constraint programming and operations research. Three main hybridization contexts have been explored: hybrid modeling, hybrid solving (algorithmic methods) and hybrid software tools. In this chapter, we concentrate on the algorithmic side of the hybridization.</ab>
    <rv></rv>
  </abgroup>
</item>