NotesFAQContact Us
Collection
Advanced
Search Tips
Source
Publication Type
Reports - Evaluative1
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing one result Save | Export
Adema, Jos J. – 1988
A heuristic for solving large-scale zero-one programming problems is provided. The heuristic is based on the modifications made by H. Crowder et al. (1983) to the standard branch-and-bound strategy. First, the initialization is modified. The modification is only useful if the objective function values for the continuous and the zero-one…
Descriptors: Achievement Tests, Computer Assisted Testing, Heuristics, Item Banks