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

DOI10.1007/S10288-004-0042-XMaRDI QIDQ1775293zbMATH OpenOpenAlexFDO

Authors 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

local searchschedulingmixed integer programmingvehicle routingbranch-and-pricehybrid algorithms

Mathematics Subject Classification ID

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

Recommendations

• Enhanced mixed integer programming techniques and routing problems
• Local Search and Constraint Programming
• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Application-oriented mixed integer non-linear programming
• Local branching in a constraint programming framework

Cited in

(2)

• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Enhanced mixed integer programming techniques and routing problems

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775293)