Article | REF: AF1251 V1

Optimization in integers

Author: Michel MINOUX

Publication date: April 10, 2008

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

Already subscribed? Log in!


Français

4. Exact resolution of integer linear programs

In this section, we present the ideas behind the main known methods for solving exact integer linear programs. The order of our presentation practically follows the chronology in which the various methods were successively developed. At the end of the 1950s, R. Gomory pioneered the first line of research to generalize the simplex algorithm to take account of integrity conditions on variables. This approach is described and illustrated in 4.1 . The second approach, which historically follows closely on the heels of the first, is known as "Branch & Bound" tree search and is described in paragraph

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!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Exact resolution of integer linear programs