"The cutting stock problem with mixed objectives: Two heuristics based on ..."

Julien Antonio et al. (1999)

> Home

Details and statistics

DOI: 10.1016/S0377-2217(98)00163-5

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/AntonioCCP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/AntonioCCP99
Julien Antonio, Fabrice Chauvet, Chengbin Chu, Jean-Marie Proth:
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming. Eur. J. Oper. Res. 114(2): 395-402 (1999)

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.