Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem-Reference-Cited by-同舟云学术

Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem

Published:2017-12-08 Issue:2 Volume:24 Page:173-203
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

Lawrinenko Alexander,Schwerdfeger Stefan,Walter Rico

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/article/10.1007/s10732-017-9362-9/fulltext.html

Reference24 articles.

1. Babel, L., Kellerer, H., Kotov, V.: The $$k$$ k -partitioning problem. Math. Methods Oper. Res. 47, 59–82 (1998)

2. Chen, S.P., He, Y., Yao, E.-Y.: Three-partitioning containing kernels: complexity and heuristic. Computing 57, 255–271 (1996)

3. Chen, S.P., He, Y., Lin, G.: 3-Partitioning problems for maximizing the minimum load. J. Comb. Optim. 6, 67–80 (2002)

4. Csirik, J., Kellerer, H., Woeginger, G.: The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11, 281–287 (1992)

5. Dell’Amico, M., Martello, S.: Optimal scheduling of tasks on identical parallel processors. ORSA J. Comput. 7, 191–200 (1995)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Alternative feature selection with user control;International Journal of Data Science and Analytics;2024-03-26

2. Optimization in Outbound Logistics—An Overview;Operations Research Proceedings;2020