Item Infomation
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Eleonora, Vercesi | - |
| dc.contributor.author | Stefano, Gualandi | - |
| dc.contributor.author | Monaldo, Mastrolilli | - |
| dc.date.accessioned | 2023-04-05T02:03:26Z | - |
| dc.date.available | 2023-04-05T02:03:26Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s12532-023-00235-7 | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7520 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | This paper introduces a computational method for generating metric Travelling Salesman Problem (TSP) instances having a large integrality gap. The method is based on the solution of an integer programming problem, called IH-OPT, that takes as input a fractional solution of the Subtour Elimination Problem (SEP) on a TSP instance and computes a TSP instance having an integrality gap larger than or equal to the integrality gap of the first instance. The decision variables of IH-OPT are the entries of the TSP cost matrix, and the constraints are defined by the intersection of the metric cone with an exponential number of inequalities, one for each possible TSP tour. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | Travelling Salesman Problem | vi |
| dc.subject | IH-OPT | vi |
| dc.title | On the generation of metric TSP instances with a large integrality gap by branch-and-cut | vi |
| dc.type | Book | vi |
| Appears in Collections | ||
| OER - Khoa học Tự nhiên | ||
Files in This Item:
