Enumeration methods 1
Aus Operations-Research-Wiki
Version vom 1. Juli 2013, 14:16 Uhr von Muellemi (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „There are two solution sets for difficult combinatorical optimization problems available: complete and incomplete enumeration methods. These solution sets also…“)
There are two solution sets for difficult combinatorical optimization problems available: complete and incomplete enumeration methods. These solution sets also apply on integer or mixed-integer optimization problems.
Inhaltsverzeichnis
Theory
Complete enumeration
A complete enumeration method guarantees, that from all possible solutions the optimum is chosen. Algorithms that always provide the optimal solution are called exact methods.
Explicit complete enumeration
Implicit complete enumeration
Incomplete enumeration
Example
Presentation of the problem
Solution process
Sources
Neumann, K.; Morlock, M.: Operations Research, 2.Auflage, Carl Hanser Verlag München Wien, 2002
