-
1
-
-
0000369074
-
Obtaining test problems via internet
-
J. E. Beasley: Obtaining Test Problems via Internet, Journal of Global Optimization 8, pp. 429-433, 1996.
-
(1996)
Journal of Global Optimization
, vol.8
, pp. 429-433
-
-
Beasley, J.E.1
-
2
-
-
85001907733
-
A weight-coded genetic algorithm for the minimum weight triangulation problem
-
ACM Press
-
K. Capp, B. Julstrom: A Weight-Coded Genetic Algorithm for the Minimum Weight Triangulation Problem, in Proc. of the 1998 ACM Symposium on Applied Computing, ACM Press, pp. 327-331, 1998.
-
(1998)
Proc. of the 1998 ACM Symposium on Applied Computing
, pp. 327-331
-
-
Capp, K.1
Julstrom, B.2
-
4
-
-
0032090794
-
A genetic algorithm for the multidimensional knapsack problem
-
P. C. Chu, J. E. Beasley: A Genetic Algorithm for the Multidimensional Knapsack Problem, Journal of Heuristics 4, pp. 63-86, 1998.
-
(1998)
Journal of Heuristics
, vol.4
, pp. 63-86
-
-
Chu, P.C.1
Beasley, J.E.2
-
5
-
-
0030645905
-
Solving 3-SAT by GAs adapting constraint weights
-
Indianapolis, IN
-
A. E. Eiben, J. K. Van der Hauw: Solving 3-SAT by GAs adapting constraint weights, in Proc. of the 1997 IEEE Int. Conf. on Evolutionary Computation, Indianapolis, IN, pp. 81-86, 1997.
-
(1997)
Proc. of the 1997 IEEE Int. Conf. on Evolutionary Computation
, pp. 81-86
-
-
Eiben, A.E.1
Van Der Hauw, J.K.2
-
6
-
-
24644482140
-
Evolutionary algorithms for multidimensional knapsack problems: The relevance of the boundary of the feasible region
-
submitted to, Orlando, FL
-
J. Gottlieb: Evolutionary Algorithms for Multidimensional Knapsack Problems: The Relevance of the Boundary of the Feasible Region, submitted to the Genetic and Evolutionary Computation Conf., Orlando, FL, 1999.
-
(1999)
The Genetic and Evolutionary Computation Conf.
-
-
Gottlieb, J.1
-
7
-
-
0028563744
-
Mapping, order-independent genes and the knapsack problem
-
Orlando, FL
-
R. Hinterding: Mapping, Order-independent Genes and the Knapsack Problem, in Proc. of the 1st IEEE Int. Conf. on Evolutionary Computation, Orlando, FL, pp. 13-17, 1994.
-
(1994)
Proc. of the 1st IEEE Int. Conf. on Evolutionary Computation
, pp. 13-17
-
-
Hinterding, R.1
-
8
-
-
85028822975
-
The zero/one multiple knapsack problem and genetic algorithms
-
ACM Press
-
S. Khuri, T. Bäck, J. Heitkotter: The Zero/One Multiple Knapsack Problem and Genetic Algorithms, in Proc. of the 1994 ACM Symposium on Applied Computing, ACM Press, pp. 188-193, 1994.
-
(1994)
Proc. of the 1994 ACM Symposium on Applied Computing
, pp. 188-193
-
-
Khuri, S.1
Bäck, T.2
Heitkotter, J.3
-
9
-
-
0038588241
-
Representing rectilinear steiner trees in genetic algorithms
-
ACM Press
-
B. Julstrom: Representing Rectilinear Steiner Trees in Genetic Algorithms, in Proc. of the 1996 ACM Symposium on Applied Computing, ACM Press, pp. 245-250, 1996.
-
(1996)
Proc. of the 1996 ACM Symposium on Applied Computing
, pp. 245-250
-
-
Julstrom, B.1
-
10
-
-
85002338977
-
Comparing decoding algorithms in a weight-coded GAfor TSP
-
ACM Press
-
B. Julstrom: Comparing Decoding Algorithms in a Weight-Coded GAfor TSP, in Proc. of the 1998 ACM Symposium on Applied Computing, ACM Press, pp. 313-317, 1998.
-
(1998)
Proc. of the 1998 ACM Symposium on Applied Computing
, pp. 313-317
-
-
Julstrom, B.1
-
11
-
-
72749095053
-
Insertion decoding algorithms and initial tours in a weight-coded GA for TSP
-
Madison, Wisconsin
-
B. Julstrom: Insertion Decoding Algorithms and Initial Tours in a Weight-Coded GA for TSP, in Proc. of the 3rd Genetic Programming Conf., Madison, Wisconsin, pp. 528-534, 1998.
-
(1998)
Proc. of the 3rd Genetic Programming Conf.
, pp. 528-534
-
-
Julstrom, B.1
-
12
-
-
84901390071
-
The maximum weight parameter in a weight-coded GAfor TSP
-
Madison, Wisconsin
-
B. Julstrom: The Maximum Weight Parameter in a Weight-Coded GAfor TSP, in Proc. of the 3rd Genetic Programming Conf., late breaking paper, Madison, Wisconsin, pp. 101-105, 1998.
-
(1998)
Proc. of the 3rd Genetic Programming Conf., Late Breaking Paper
, pp. 101-105
-
-
Julstrom, B.1
-
13
-
-
0021442262
-
A heuristic algorithm for the multidimensional zero-one knapsack problem
-
M. J. Magazine, O. Oguz: A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem, European Journal of Operational Research 16, pp. 319-326, 1984.
-
(1984)
European Journal of Operational Research
, vol.16
, pp. 319-326
-
-
Magazine, M.J.1
Oguz, O.2
-
16
-
-
0028563759
-
Representing trees in genetic algorithms
-
Orlando, FL
-
C. C. Palmer, A. Kershenbaum: Representing Trees in Genetic Algorithms, in Proc. of the 1st IEEE Int. Conf. on Evolutionary Computation, Orlando, FL, pp. 379-384, 1994.
-
(1994)
Proc. of the 1st IEEE Int. Conf. on Evolutionary Computation
, pp. 379-384
-
-
Palmer, C.C.1
Kershenbaum, A.2
-
17
-
-
0023332292
-
A heuristic solution procedure for the multiconstrained zero-one knapsack problem
-
H. Pirkul: A Heuristic Solution Procedure for the Multiconstrained Zero-One Knapsack Problem, Naval Research Logistics 34, pp. 161-172, 1987.
-
(1987)
Naval Research Logistics
, vol.34
, pp. 161-172
-
-
Pirkul, H.1
-
18
-
-
0031704179
-
An improved genetic algorithm for the multiconstrained 0-1 knapsack problem
-
Anchorage, Alaska
-
G. R. Raidl: An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem, in Proc. of the 5th IEEE Int. Conf. on Evolutionary Computation, Anchorage, Alaska, pp. 207-211, 1998.
-
(1998)
Proc. of the 5th IEEE Int. Conf. on Evolutionary Computation
, pp. 207-211
-
-
Raidl, G.R.1
-
19
-
-
0032688840
-
A weight-coded genetic algorithm for the multiple container packing problem
-
San Antonio, TX
-
G. R. Raidl: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem, to appear in Proc. of the 14th ACM Symposium on Applied Computing, San Antonio, TX, 1999.
-
(1999)
Proc. of the 14th ACM Symposium on Applied Computing
-
-
Raidl, G.R.1
-
21
-
-
0000949659
-
Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms
-
J. Thiel, S. Voss: Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms, INFOR 32, pp. 226-242, 1994.
-
(1994)
INFOR
, vol.32
, pp. 226-242
-
-
Thiel, J.1
Voss, S.2
|