default search action

combined dblp search
author search
venue search
publication search

ask others

"Reducing the Branching in a Branch and Bound Algorithm for the Maximum ..."

Ciaran McCreesh, Patrick Prosser (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-10428-7_40

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cp/McCreeshP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/McCreeshP14
Ciaran McCreesh, Patrick Prosser:
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. CP 2014: 549-563

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.