dx.doi.org/10.1007/978-3-030-19212-9_12

Preview meta tags from the dx.doi.org website.

Linked Hostnames

23

Thumbnail

Search Engine Appearance

Google

https://dx.doi.org/10.1007/978-3-030-19212-9_12

Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming...



Bing

Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

https://dx.doi.org/10.1007/978-3-030-19212-9_12

The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming...



DuckDuckGo

https://dx.doi.org/10.1007/978-3-030-19212-9_12

Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming...

  • General Meta Tags

    39
    • title
      Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems | SpringerLink
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • viewport
      width=device-width, initial-scale=1
    • applicable-device
      pc,mobile

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/chapter/10.1007/978-3-030-19212-9_12
    • og:type
      Paper
    • og:site_name
      SpringerLink
    • og:title
      Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems
    • og:description
      The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming...

  • Twitter Meta Tags

    6
    • twitter:site
      SpringerLink
    • twitter:card
      summary
    • twitter:image:alt
      Content cover image
    • twitter:title
      Using Cost-Based Solution Densities from TSP Relaxations to Solve Rout
    • twitter:description
      The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/chapter/10.1007/978-3-030-19212-9_12
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Emails

1

Links

121