"A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing ..."

Lijun Wei et al. (2020)

> Home

Details and statistics

DOI: 10.1287/IJOC.2018.0867

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/WeiLBL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/WeiLBL20
Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. INFORMS J. Comput. 32(2): 428-443 (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.