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 $f : ℝ^{n} \to ℝ$ on a given subset X of $ℝ^{n}$ , called the set of admissible solutions. Without loss of generality, we can assume that X is described as the set of points of $ℝ^{n}$ ...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Context

Previous
page Optimization in integers

Example of a production engineering application

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details

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!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!