"A branch-and-cut algorithm for the maximum covering cycle problem."

Eduardo Álvarez-Miranda, Markus Sinnl (2020)

> Home

Details and statistics

DOI: 10.1007/S10479-018-2856-5

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/Alvarez-Miranda20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/Alvarez-Miranda20
Eduardo Álvarez-Miranda, Markus Sinnl:
A branch-and-cut algorithm for the maximum covering cycle problem. Ann. Oper. Res. 284(2): 487-499 (2020)

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.