"The quadratic minimum spanning tree problem: A lower bounding procedure ..."

Temel Öncan, Abraham P. Punnen (2010)

> Home

Details and statistics

DOI: 10.1016/J.COR.2010.01.004

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/OncanP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/OncanP10
Temel Öncan, Abraham P. Punnen:
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. Comput. Oper. Res. 37(10): 1762-1773 (2010)

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.