"Branch-and-bound solves random binary IPs in poly(n)-time."

Santanu S. Dey, Yatharth Dubey, Marco Molinaro (2023)

> Home

Details and statistics

DOI: 10.1007/S10107-022-01895-4

access: closed

type: Journal Article

metadata version: 2023-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/DeyD023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/DeyD023
Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200(1): 569-587 (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.