Lattice animals: A fast enumeration algorithm and new perimeter polynomials

1990 ◽  
Vol 58 (5-6) ◽  
pp. 1095-1108 ◽  
Author(s):  
S. Mertens
Keyword(s):  
Lattice Animals ◽  
Enumeration Algorithm ◽  
Perimeter Polynomials

The Location Problem of Given and Indivisible Different Units

1970 ◽  
Vol 2 (3) ◽  
pp. 341-356
Author(s):  
G. Jándy
Keyword(s):  
Exact Solution ◽  
Heuristic Algorithm ◽  
Network Flow ◽  
Location Problem ◽  
Optimal Solution ◽  
Type Problem ◽  
Distribution Problem ◽  
Enumeration Algorithm ◽  
Weighted Distribution ◽  
Partial Enumeration

In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.

General model for collapse in lattice animals

1992 ◽  
Vol 25 (19) ◽  
pp. L1169-L1172 ◽  
Author(s):  
S Flesia ◽  
D S Gaunt ◽  
C E Soteros ◽  
S G Whittington
Keyword(s):  
General Model ◽  
Lattice Animals

scholarly journals Crossing Velocities and Random Lattice Animals

1995 ◽  
Vol 23 (3) ◽  
pp. 1006-1023 ◽  
Author(s):  
Alain-Sol Sznitman
Keyword(s):  
Lattice Animals ◽  
Random Lattice

scholarly journals Statistics of lattice animals (polyominoes) and polygons

2000 ◽  
Vol 33 (29) ◽  
pp. L257-L263 ◽  
Author(s):  
Iwan Jensen ◽  
Anthony J Guttmann
Keyword(s):  
Lattice Animals
Sign in / Sign up

Export Citation Format

Share Document