"A new branch-and-bound algorithm for the maximum edge-weighted clique problem."

Pablo San Segundo et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2019.03.047

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/SegundoCFL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/SegundoCFL19
Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic:
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1): 76-90 (2019)

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.