Timeline for Combinatorial graph optimization problem on integer adjacency matrices
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2021 at 14:01 | vote | accept | Penelope Benenati | ||
| Oct 21, 2021 at 15:26 | answer | added | Peter Taylor | timeline score: 2 | |
| Oct 21, 2021 at 14:17 | comment | added | Penelope Benenati | Thank you @PeterTaylor, you are right. In formulating the problem here, I oversimplified the original graph problem I am attempting to solve. Hence, now I corrected the definition of $z_{i,j}$ to better match my underlying original problem. | |
| Oct 21, 2021 at 14:15 | history | edited | Penelope Benenati | CC BY-SA 4.0 |
Corrected the definition of $z_{i,j}$.
|
| Oct 21, 2021 at 12:56 | history | edited | Penelope Benenati | CC BY-SA 4.0 |
edited body
|
| Oct 21, 2021 at 12:31 | history | edited | Penelope Benenati | CC BY-SA 4.0 |
Added note about graph-theory perspective
|
| Oct 21, 2021 at 12:07 | history | edited | Penelope Benenati | CC BY-SA 4.0 |
Added the tag "Graph-theory" because matrices $M$ can be viewed as adjacency matrices, and $z_{i,j}$ can be viewed as a kind of flow in the given network.
|
| Oct 20, 2021 at 16:13 | history | edited | Penelope Benenati | CC BY-SA 4.0 |
added 10 characters in body
|
| Oct 20, 2021 at 15:45 | history | asked | Penelope Benenati | CC BY-SA 4.0 |