Timeline for Subtour-gluing constraints for ILP formulation of TSPs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2021 at 12:54 | history | edited | Manfred Weis | CC BY-SA 4.0 |
fixed a typo in the title
|
| Dec 5, 2021 at 8:37 | history | edited | Martin Sleziak |
added (traveling-salesman-problem) and (integer-programming)
|
|
| Dec 5, 2021 at 8:34 | comment | added | Manfred Weis | @RobPratt thanks for the feedback. I have added a formal definition of the proposed constraint using a bit non-standard notation. | |
| Dec 5, 2021 at 8:32 | history | edited | Manfred Weis | CC BY-SA 4.0 |
provided a formal definition of the proposed contraint in reply to RobPratt's comment
|
| Dec 5, 2021 at 4:34 | comment | added | RobPratt | Suppose $\cup_{i=1}^k S_i$ is the corresponding partition of the nodes. What is the constraint you are proposing? | |
| Dec 4, 2021 at 14:25 | history | asked | Manfred Weis | CC BY-SA 4.0 |