Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Implicit enumeration

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_441
  • 21 Downloads

A process for solving integer-programming problems in which all possible integer solutions need not be investigated (enumerated) due to information obtained in the process that relates to problem feasibility and value of the objective function. That is, certain solutions need not be pursued as it can be shown that they would lead to infeasible solutions or values of the objective function that are worse than those that are known to be possible. Branch and bound.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA