0.25
0.5
0.75
1.25
1.5
1.75
2
Solving hard optimization problems of packing, covering, and tiling via clique search
Published on Oct 21, 20249 Views
In the paper we propose to convert NP-hard combinatorial optimization problems of packing, covering, and tiling types into maximum or k-clique problems. The key step is to come up with a tactically co
Related categories
Chapter list
Solving hard optimization problems of packing, covering, and tiling via clique search00:00
Why graphs? - 100:56
Why graphs? - 201:02
Why graphs? - 301:12
Why graphs? - 401:23
Why graphs? - 501:56
Naturally occurring graphs02:28
Mathematical Programming - 105:06
Mathematical Programming - 205:58
Our research07:35
Packing, covering, and tiling07:48
Packing a sequence of squares into 66x66 square09:11
Tiling – Conway puzzle09:48
Example problem: brick packing10:40
Packing with bricks - 111:47
Packing with bricks - 213:05
Tiling with bricks and unit cubes - 113:41
Tiling with bricks and unit cubes - 214:38
Slabs15:04
Numerical experiments - 115:42
Numerical experiments - 215:42
Numerical experiments - 315:43
Numerical experiments - 415:54
Numerical experiments - 516:30
Thank you for your attention!16:53