Dead-end elimination
id:
dead-end-elimination-234-1140442
title:
Dead-end elimination
text:
The dead-end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to identify "dead ends", i.e., combinations of variables that are not necessary to define a global minimum because there is always a way of replacing such combination by a better or equivalent one. Then we can refrain from searching such combinations further. Hence, dead-end elimination is a mirror image of dynamic programming, in which "good" combination
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for minimizing a function over a set of independent variables
original url:
https://en.wikipedia.org/wiki/Dead-end_elimination
date created:
date modified:
2022-09-04T06:14:15Z
main entity:
{"identifier":"Q5245065","url":"https://www.wikidata.org/entity/Q5245065"}
image:
fields total:
13
integrity:
14