"A Constraint Programming Approach to Extract the Maximum Number of ..."

Dmitry I. Belov, Ronald D. Armstrong (2006)

> Home

Details and statistics

DOI: 10.1007/S10589-005-3058-Z

access: closed

type: Journal Article

metadata version: 2020-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/BelovA06a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/BelovA06a
Dmitry I. Belov, Ronald D. Armstrong:
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. Comput. Optim. Appl. 33(2-3): 319-332 (2006)

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.