Maximum diversity/similarity models with extension to part grouping-Reference-Cited by-同舟云学术

Maximum diversity/similarity models with extension to part grouping

Published:2005-05 Issue:3 Volume:12 Page:311-323
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Adil Gajendra K.,Ghosh Jay B.

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2005.497_1.x/fullpdf

Reference45 articles.

1. Assignment allocation and simulated annealing algorithms for cell formation

2. Lagrangian solution of maximum dispersion problems

3. Production flow analysis

4. Exact Solution of the Quadratic Knapsack Problem

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

1. Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS;Computers & Operations Research;2022-03

2. A new use of the ant system algorithm for the max-mean dispersion problem;Computers & Industrial Engineering;2019-09

3. Solving the maximum min-sum dispersion by alternating formulations of two different problems;European Journal of Operational Research;2017-07

4. A new algorithm to create balanced teams promoting more diversity;European Journal of Engineering Education;2017-03-05

5. Less is more: Solving the Max-Mean diversity problem with variable neighborhood search;Information Sciences;2017-03