More Web Proxy on the site http://driver.im/

Joint Declaration: The freedom of science is at the heart of liberal, democratic societies. Without this freedom, it is impossible for scientific efforts to be geared toward gaining knowledge and facts. It is therefore extremely worrying that the scientific freedom is coming under increasing pressure in various regions of the world. (read more)

We've just launched a new service: our brand new dblp SPARQL query service. Read more about it in our latest blog post or try out some of the SPARQL queries linked on the dblp web pages below.

default search action

combined dblp search
author search
venue search
publication search

ask others

"Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms ..."

Dilson Lucas Pereira, Alexandre Salles da Cunha (2018)

> Home

Details and statistics

DOI: 10.1002/NET.21787

access: closed

type: Journal Article

metadata version: 2018-01-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/PereiraC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/PereiraC18
Dilson Lucas Pereira, Alexandre Salles da Cunha:
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 71(1): 31-50 (2018)

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.