A constraint programming approach to extract the maximum number of non-overlapping test forms

DOI10.1007/s10589-005-3058-zzbMath1103.90079OpenAlexW2004121289MaRDI QIDQ2506175

Dmitry I. Belov, Ronald D. Armstrong

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10.1007/s10589-006-9274-3

zbMATH Keywords

combinatorial optimizationbranch-and-boundset packingconstraint programmingtest assembly

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Uniform test assembly

Uses Software

• CPLEX
• STL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Achievement test construction using 0-1 linear programming
• An algorithm for finding a maximum clique in a graph
• Decentralized computation procurement and computational robustness in a smart market
• Scheduling classes on a college campus
• Combinatorial Auctions: A Survey
• Set Partitioning: A survey

This page was built for publication: A constraint programming approach to extract the maximum number of non-overlapping test forms