Integrating local search techniques into mixed integer programming

被引：0
作者：
Danna E. [1 ,2 ]
机构：
[1] ILOG, 94253 Gentilly Cedex
[2] Laboratoire d'Informatique d'Avignon, CNRS FRE 2487, 84911 Avignon, Cedex 9, 339 Chemin des Meinajariés
来源：
4OR | 2004年 / 2卷 / 4期
关键词：
branch-and-price; hybrid algorithms; local search; Mixed integer programming; scheduling; vehicle routing;
D O I：
10.1007/s10288-004-0042-x
中图分类号：
学科分类号：
摘要：
We survey the main results of the author's PhD thesis that was supervised by Claude Le Pape (ILOG, France) and Philippe Michelon (Université d'Avignon, France) and has been defended in June 2004. The dissertation is written in French and is available from the author. It introduces several strategies for integrating local search techniques into mixed integer programming, with an emphasis on generic algorithms. © 2004 Springer-Verlag Berlin/Heidelberg.
引用
收藏
页码：321 / 324
页数：3
相关论文
共 12 条
  • [1] Bixby R.E., Fenelon M., Gu Z., Rothberg E., Wunderling R., MIP: Theory and practice-closing the gap, System modelling and optimization: Methods, theory, and applications, pp. 19-49, (2000)
  • [2] Chabrier A., Danna E., Le Pape C., Coopération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au routage de véhicules (in French), Huitièmes journées nationales sur la résolution de problèmes NP-complets (JNPC'02), pp. 83-97, (2002)
  • [3] Chabrier A., Danna E., Le Pape C., Perron L., Solving a network design problem, Annals of Operations Research, (2004)
  • [4] Danna E., Improving and extending the disjunctive MIP model for the earliness-tardiness job-shop scheduling problem, Ninth International Workshop on Project Management and Scheduling (PMS'04), pp. 250-253, (2004)
  • [5] Danna E., Le Pape C., Branch-and-price heuristics: A case study on the vehicle routing problem with time windows, 25th anniversary GERAD book on column generation (in revision), (2004)
  • [6] Danna E., Le Pape C., Two generic schemes for efficient and robust cooperative algorithms, Constraint and integer programming, pp. 33-57, (2004)
  • [7] Danna E., Perron L., Structured vs. unstructured large neighborhood search: A case study on jobshop scheduling problems with earliness and tardiness costs, Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP'03), pp. 817-821, (2003)
  • [8] Danna E., Rothberg E., Le Pape C., Integrating mixed integer programming and local search: A case study on job-shop scheduling problems, Proceedings of the Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'03), pp. 65-79, (2003)
  • [9] Danna E., Rothberg E., Le Pape C., Exploring relaxation induced neighborhoods to improve MIP solutions, Mathematical Programming, (2004)
  • [10] Fischetti M., Lodi A., Local branching, Mathematical Programming, Series B, 98, pp. 23-47, (2003)
12