"(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for ..."

Martin Gruber, Günther R. Raidl (2010)

> Home

Details and statistics

DOI: 10.1007/978-1-4419-1306-7_8

access: closed

type: Part in Book or Collection

metadata version: 2017-05-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - series/anis/GruberR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/anis/GruberR10
Martin Gruber, Günther R. Raidl:
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Matheuristics 2010: 209-229

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.