"A discrete dynamic convexized method for the max-cut problem."

Geng Lin, Wenxing Zhu (2012)

> Home

Details and statistics

DOI: 10.1007/S10479-012-1133-2

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/LinZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/LinZ12
Geng Lin, Wenxing Zhu:
A discrete dynamic convexized method for the max-cut problem. Ann. Oper. Res. 196(1): 371-390 (2012)

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.