"CliSAT: A new exact algorithm for hard maximum clique problems."

Pablo San Segundo et al. (2023)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2022.10.028

access: open

type: Journal Article

metadata version: 2023-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/eor/SegundoFAP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/SegundoFAP23
Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos:
CliSAT: A new exact algorithm for hard maximum clique problems. Eur. J. Oper. Res. 307(3): 1008-1025 (2023)

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.