Timeline for Enumerating the elements of cartesian products in ascending order of $\|\cdot\|_1$ norm
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2022 at 13:52 | comment | added | Manfred Weis | @ReidBarton that's indeed so; but I haven't yet seen a similar algorithm mentioned in the context of combinatorial optimization despite it'solves a fairly basic "sub problem" and may be used to find improved lower bounds to the solution of certain combinatorial optimization problems. | |
| Jun 18, 2022 at 13:08 | comment | added | Reid Barton | This seems like the obvious approach to the question in the title. It's basically Dijkstra's algorithm on a product of line graphs. | |
| Jun 18, 2022 at 12:27 | history | answered | Manfred Weis | CC BY-SA 4.0 |