Author:
Peeters Marc,Degraeve Zeger
Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference28 articles.
1. A dynamic subgradient-based branch-and-bound procedure for set covering;Balas;Operations Research,1996
2. A survey of exact algorithms for the simple assembly line balancing problem;Baybars;Management Science,1986
3. Branch-and-bound algorithms for the multi-product assembly line balancing problem;Berger;European Journal of Operational Research,1992
4. A depth-first dynamic programming algorithm for the tree knapsack problem;Cho;INFORMS Journal on Computing,1997
5. Degraeve, Z., Peeters, M., 2000. Solving the Linear Programming Relaxation of Cutting and Packing Problems: A Hybrid Simplex Method/Subgradient Optimization Procedure, Onderzoeksrapport NR 0017. Departement Toegepaste Economische Wetenschappen, K.U. Leuven, Leuven.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献