Author:
Gadegaard Sune Lauth,Klose Andreas,Nielsen Lars Relund
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference34 articles.
1. Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33(1), 42–54.
2. Balinski, M. (1965). Integer programming: Methods, uses, computations. Management Science, 12(3), 253–313.
3. Bérubé, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). An exact
$$\epsilon $$
ϵ
-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research, 194(1), 39–50.
4. Chalmet, L., Lemonidis, L., & Elzinga, D. (1986). An algorithm for the bi-criterion integer programming problem. European Journal of Operational Research, 25(2), 292–300.
5. Cornuejols, G., Nemhauser, G., & Wolsey, L. A. (1990). The uncapacitated facility location problem. In P. Mirchandani & R. Francis (Eds.), Discrete Location Theory. New York: Wiley-Interscience.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献