Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference24 articles.
1. Beasley, J. (1993). Lagrangian relaxation. In Modern heuristic techniques for combinatorial problems (pp. 243–303). New York: Wiley.
2. Eckstein, J., & Nediak, M. (2007). Pivot, cut and dive: a heuristic for mixed 0-1 integer programming. Journal of Heuristics, 13(5), 471–503.
3. Freville, A., & Plateau, G. (1986). Heuristics and reduction methods for multiple constraint 0-1 linear programming problems. European Journal of Operational Research, 24, 206–215.
4. Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1), 73–88.
5. Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156–166.
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献