-
1
-
-
20444457426
-
Evolver 4.0: The genetic algorithm super solver
-
Bergey, P. K., & Ragsdale, C. T. (1999). Evolver 4.0: The genetic algorithm super solver. OR/MS Today 6(4), 44-47.
-
(1999)
OR/MS Today
, vol.6
, Issue.4
, pp. 44-47
-
-
Bergey, P.K.1
Ragsdale, C.T.2
-
2
-
-
0035314309
-
Comparing descent heuristics and metaheuristics for the vehicle routing problem
-
Breedam, A. V. (2000). Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operation Research, 25(4), 289-315.
-
(2000)
Computers and Operation Research
, vol.25
, Issue.4
, pp. 289-315
-
-
Breedam, A.V.1
-
3
-
-
0030247586
-
A simulated annealing heuristic for the one-dimensional cutting stock problem
-
Chen, C., Hart, S., & Tham, W. (1996). A simulated annealing heuristic for the one-dimensional cutting stock problem. European Journal of Operations Research, 93(3), 522-535.
-
(1996)
European Journal of Operations Research
, vol.93
, Issue.3
, pp. 522-535
-
-
Chen, C.1
Hart, S.2
Tham, W.3
-
4
-
-
0019635339
-
A new linear programming approach to the cutting stock problem
-
Dyckhoff, H. (1981). A new linear programming approach to the cutting stock problem. Operations Research, 29(6), 1092-1104.
-
(1981)
Operations Research
, vol.29
, Issue.6
, pp. 1092-1104
-
-
Dyckhoff, H.1
-
5
-
-
0025210672
-
A typology of cutting and packing problems
-
Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operations Research, 1(44), 145-159.
-
(1990)
European Journal of Operations Research
, vol.1
, Issue.44
, pp. 145-159
-
-
Dyckhoff, H.1
-
6
-
-
0027005303
-
A genetic algorithm for bin packing and line balancing
-
May 10-15, 1992, Nice, France. Los Alamitos, CA: IEEE Computer Society Press
-
Falkenauer, E., & Delchambre, A. (1992). A genetic algorithm for bin packing and line balancing. In Proceedings of the 1992 IEEE International Conference on Robotics and Automation, May 10-15, 1992, Nice, France. Los Alamitos, CA: IEEE Computer Society Press, 1186-1192.
-
(1992)
Proceedings of the 1992 IEEE International Conference on Robotics and Automation
, pp. 1186-1192
-
-
Falkenauer, E.1
Delchambre, A.2
-
7
-
-
0032188527
-
Simulated annealing for order spread minimization in sequencing cutting patterns
-
Foerster, H., & Wascher, G. (1998). Simulated annealing for order spread minimization in sequencing cutting patterns. European Journal of Operations Research, 110(2), 272-281.
-
(1998)
European Journal of Operations Research
, vol.110
, Issue.2
, pp. 272-281
-
-
Foerster, H.1
Wascher, G.2
-
8
-
-
0001510482
-
A linear programming approach to the cutting stock problem
-
Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 849-859.
-
(1961)
Operations Research
, vol.9
, pp. 849-859
-
-
Gilmore, P.C.1
Gomory, R.E.2
-
9
-
-
0000143954
-
A linear programming approach to the cutting stock problem: Part 2
-
Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem: Part 2. Operations Research, 11(6), 863-888.
-
(1963)
Operations Research
, vol.11
, Issue.6
, pp. 863-888
-
-
Gilmore, P.C.1
Gomory, R.E.2
-
10
-
-
0042802978
-
-
Technical report 24COMP3. Victoria, Australia: Department of Computer and Mathematical Sciences, Victoria University of Technology
-
Hinterding, R., & Juliff, K. (1993). A genetic algorithm for stock cutting: An exploration of mapping schemes. Technical report 24COMP3. Victoria, Australia: Department of Computer and Mathematical Sciences, Victoria University of Technology.
-
(1993)
A Genetic Algorithm for Stock Cutting: An Exploration of Mapping Schemes
-
-
Hinterding, R.1
Juliff, K.2
-
11
-
-
84958974326
-
Genetic algorithms for cutting stock problems: With and without contiguity
-
X. Yao (Ed.). New York: Springer
-
Hinterding, R., & Khan, L. (1995). Genetic algorithms for cutting stock problems: With and without contiguity. In X. Yao (Ed.), Lecture notes in computer science, v. 956, progress in evolutionary computation. Selected papers. New York: Springer, 166-186.
-
(1995)
Lecture Notes in Computer Science, V. 956, Progress in Evolutionary Computation. Selected Papers
, vol.956
, pp. 166-186
-
-
Hinterding, R.1
Khan, L.2
-
12
-
-
0026988817
-
Genetic algorithms
-
Holland, J. H. (1992). Genetic algorithms. Scientific American, 267(1), 66-72.
-
(1992)
Scientific American
, vol.267
, Issue.1
, pp. 66-72
-
-
Holland, J.H.1
-
13
-
-
22044454669
-
Solving cutting stock problems by evolutionary programming
-
V. W. Porto, N. Saravanan, D. Waagen, & A. E. Eiben (Eds.), New York: Springer
-
Liang, K., Yao, X., Newton, C., & Hoffman, D. (1998). Solving cutting stock problems by evolutionary programming. In V. W. Porto, N. Saravanan, D. Waagen, & A. E. Eiben (Eds.), Evolutionary programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming (EP'98), Lecture Notes in Computer Science. Vol. 1447, New York: Springer, 755-764.
-
(1998)
Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming (EP'98), Lecture Notes in Computer Science
, vol.1447
, pp. 755-764
-
-
Liang, K.1
Yao, X.2
Newton, C.3
Hoffman, D.4
-
14
-
-
0036778942
-
A new evolutionary approach to cutting stock problems with and without contiguity
-
Liang, K., Yao, X., Newton, C., & Hoffman, D. (2002). A new evolutionary approach to cutting stock problems with and without contiguity. Computers and Operations Research, 29(12), 1641-1659.
-
(2002)
Computers and Operations Research
, vol.29
, Issue.12
, pp. 1641-1659
-
-
Liang, K.1
Yao, X.2
Newton, C.3
Hoffman, D.4
-
15
-
-
10844226076
-
-
Newfield, NY: Palisade Corp.
-
Palisade Corporation. (2001). Evolver 4.0 (http://www.palisade.com). Newfield, NY: Palisade Corp.
-
(2001)
Evolver 4.0
-
-
-
16
-
-
0001017536
-
Genetic algorithms for the operations researcher
-
Reeves, C. R. (1997). Genetic algorithms for the operations researcher. INFORMS Journal on Computing, 9(3), 231-265.
-
(1997)
INFORMS Journal on Computing
, vol.9
, Issue.3
, pp. 231-265
-
-
Reeves, C.R.1
-
17
-
-
0034065487
-
A heuristic for the pickup and delivery traveling salesman problem
-
Renaud, J., Boctor, F., & Ouenniche, J. (2000). A heuristic for the pickup and delivery traveling salesman problem. Computers and Operations Research, 27(9), 905-916.
-
(2000)
Computers and Operations Research
, vol.27
, Issue.9
, pp. 905-916
-
-
Renaud, J.1
Boctor, F.2
Ouenniche, J.3
-
18
-
-
0032883023
-
Global optimization of energy and production in process industries: A genetic algorithm application
-
Santos, A., & Dourado, A. (1999). Global optimization of energy and production in process industries: A genetic algorithm application. Control Engineering Practice, 7(4), 549-554.
-
(1999)
Control Engineering Practice
, vol.7
, Issue.4
, pp. 549-554
-
-
Santos, A.1
Dourado, A.2
-
19
-
-
0035576826
-
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
-
Scheithauer, G., Terno, J., & Muller, A. (2001). Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. Journal of the Operational Research Society, 52(12), 1390-1401.
-
(2001)
Journal of the Operational Research Society
, vol.52
, Issue.12
, pp. 1390-1401
-
-
Scheithauer, G.1
Terno, J.2
Muller, A.3
-
20
-
-
0034300581
-
A fuzzy satisficing method for electric power plant coal purchase using genetic algorithms
-
Shiromaru, I., Inuiguchi, M., & Sakawa, M. (2000). A fuzzy satisficing method for electric power plant coal purchase using genetic algorithms. European Journal of Operational Research, 126(1), 218-230.
-
(2000)
European Journal of Operational Research
, vol.126
, Issue.1
, pp. 218-230
-
-
Shiromaru, I.1
Inuiguchi, M.2
Sakawa, M.3
-
21
-
-
0026885171
-
A categorized application-oriented research bibliography on cutting and packing problems
-
Sweeney, P. E., & Paternoster, E. R. (1992). A categorized application-oriented research bibliography on cutting and packing problems. Journal of the Operational Research Society, 43, 691-706.
-
(1992)
Journal of the Operational Research Society
, vol.43
, pp. 691-706
-
-
Sweeney, P.E.1
Paternoster, E.R.2
-
22
-
-
0001782387
-
Exact solution of one-dimensional cutting stock problems using column generation and branch-and-bound
-
Valério de Carvalho, J. M. (1998). Exact solution of one-dimensional cutting stock problems using column generation and branch-and-bound. International Transactions in Operational Research, 5(1), 35-44.
-
(1998)
International Transactions in Operational Research
, vol.5
, Issue.1
, pp. 35-44
-
-
Valério De Carvalho, J.M.1
-
24
-
-
0032650405
-
Solving the medium newspaper production/distribution problem
-
Van Buer, M., Woodruff, D., & Olson, R. T. (1999). Solving the medium newspaper production/distribution problem. European Journal of Operational Research, 115(2), 237-253.
-
(1999)
European Journal of Operational Research
, vol.115
, Issue.2
, pp. 237-253
-
-
Van Buer, M.1
Woodruff, D.2
Olson, R.T.3
-
25
-
-
0032657061
-
A genetic algorithm solution for one-dimensional bundled stock cutting
-
Wagner, B. J. (1999). A genetic algorithm solution for one-dimensional bundled stock cutting. European Journal of Operational Research, 117(2), 368-381.
-
(1999)
European Journal of Operational Research
, vol.117
, Issue.2
, pp. 368-381
-
-
Wagner, B.J.1
|