"A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph ..."

Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero (2022)

> Home

Details and statistics

DOI: 10.48786/INOC.2022.04

access: closed

type: Conference or Workshop Paper

metadata version: 2022-04-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/inoc/PanBB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/inoc/PanBB22
Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero:
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. INOC 2022: 1-6

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.