A multiple-choice genetic algorithm for a nonlinear cutting stock problem

被引：0

作者：

Bean, James C. ^{[1
]}

机构：

[1] Dept. of Indust. and Operations Eng., Univ. of Michigan, Ann Arbor, MI 48109-2117, United States

来源：

Computing in Science and Engineering | 2000年 / 2卷 / 02期

关键词：

D O I：

10.1109/5992.877404

中图分类号：

学科分类号：

摘要：

No abstract available

引用

页码：80 / 83

共 50 条

[1] A multiple-choice genetic algorithm for a nonlinear cutting stock problem
Bean, JC
COMPUTING IN SCIENCE & ENGINEERING, 2000, 2 (02) : 80 - 83
[2] An algorithm for the Multidimensional Multiple-choice Knapsack Problem
Moser, M
Jokanovic, DP
Shiratori, N
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 582 - 589
[3] Genetic algorithm for the multiple-choice integer program
Univ of Michigan, Ann Arbor, United States
Oper Res, 1 (92-101):
[4] A genetic algorithm for the multiple-choice integer program
BenHadjAlouane, A
Bean, JC
OPERATIONS RESEARCH, 1997, 45 (01) : 92 - 101
[5] A genetic algorithm approach for the cutting stock problem
Godfrey C. Onwubolu
Michael Mutingi
Journal of Intelligent Manufacturing, 2003, 14 : 209 - 218
[6] A genetic algorithm approach for the cutting stock problem
Onwubolu, GC
Mutingi, M
JOURNAL OF INTELLIGENT MANUFACTURING, 2003, 14 (02) : 209 - 218
[7] AN ALGORITHM FOR LINEAR MULTIPLE-CHOICE KNAPSACK-PROBLEM
DUDZINSKI, K
WALUKIEWICZ, S
LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1984, 226 : 433 - 439
[8] A MINIMAL ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK-PROBLEM
PISINGER, D
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (02) : 394 - 410
[9] Fast solution algorithm of multiple-choice knapsack problem
Bao, Jiang-Hong
Yang, Qi-Gui
Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2009, 37 (04): : 42 - 45
[10] An exact algorithm for the multiple-choice Knapsack problem with setups
Boukhari, Samah
Hifi, Mhand
COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 188

← 1 2 3 4 5 →