Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme

References

• Dakin , R.J. 1965 . A tree-search algorithm for mixed integer programming problems . The Computer Journal , 8 : 250 – 255 .
   Web of Science ®Google Scholar
• Faaland , B.H. and Hilueb , F.S. 1979 . Interior path methods for heuristic integer programming procedures . Operat. Res , 27 : 1069 – 1086 .
   Google Scholar
• Hofstedt , K. and Melt , W. 1971 . Über einen Algorithmus zur Losung gemischt-ganz-zahiiger Optimalprobleme . Math. Operationsforschung und Statistik , 2 : 199 – 212 .
   Google Scholar
• Ibaraki , T. , Ohashi , T. and Mine , H. 1974 . A heuristic algorithm for mixed-integer programming problems . Math. Programming Study , 2 : 115 – 136 .
   Google Scholar
• Nauss , R.M. 1979 . Parametric integer programming , Columbia : University of Missouri Studies . Missouri,London:University of Missouri Press VIII
   Google Scholar
• Rountree , S.L.K. and Gelustt , B.E. 1982 . Parametric integer linear programming: A synthesis of branch and bound with cutting planes . European Journal of Operational Research , 10 : 183 – 189 .
   Google Scholar
• Suhl , U. . The implementation of hybrid algorithms in MPSX/370 using its extended control language . Proc. Operat. Res. 8. DGOR. Pap. Annu. Meet . Berlin-West. Vol. 86 , pp. 4 – 6 . Würzburg - Wien .
   Google Scholar
•  Google Scholar
•  Google Scholar
•  Google Scholar