Integrating local search techniques into mixed integer programming. (Thesis)

DOI10.1007/S10288-004-0042-XzbMath1114.90445OpenAlexW2091554944MaRDI QIDQ1775293

Emilie Danna

Publication date: 6 May 2005

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-004-0042-x

zbMATH Keywords

schedulingvehicle routinglocal searchmixed integer programminghybrid algorithmsbranch-and-price

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CPLEX

This page was built for publication: Integrating local search techniques into mixed integer programming. (Thesis)