"Complexity and heuristics for the weighted max cut-clique problem."

Mathias Bourel et al. (2022)

> Home

Details and statistics

DOI: 10.1111/ITOR.12807

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/itor/BourelCRRS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/itor/BourelCRRS22
Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile:
Complexity and heuristics for the weighted max cut-clique problem. Int. Trans. Oper. Res. 29(2): 908-928 (2022)

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.