1. Context
A constrained integer optimization problem is generally defined as the search for the minimum (or maximum) of a real function of n real variables
on a given subset X of
, called the set of admissible solutions. Without loss of generality, we can assume that X is described as the set of points of
...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Bibliography
References
-
(1) - BALAS (E.) -
An Additive Algorithm for Solving Linear Programs with Zero-one Variables.
-
Operations Research, 13, 4, p. 517-546 (1965).
-
(2) - BALAS (E.) -
Disjunctive Programming.
-
Annals of Discrete Mathematics,...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!