"Complexity of branch-and-bound and cutting planes in mixed-integer ..."

Amitabh Basu et al. (2023)

> Home

Details and statistics

DOI: 10.1007/S10107-022-01789-5

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/BasuCSJ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/BasuCSJ23
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198(1): 787-810 (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.