1. Home
  2. Control Engineering - Robotics
  3. Control and systems engineering
  4. Discrete optimization

  5. Algorithm and problem complexity

Article | REF: S7211 V1

Discrete optimization

Authors: Marie-Claude PORTMANN, Ammar OULAMARA

Publication date: December 10, 2006

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

Already subscribed? Log in!

Français

2. Algorithm and problem complexity

For any problem, we associate a size n which is proportional to the length of the data contained in the statement (neglecting calculations whose duration does not depend on the number of data contained in the statement). For the examples presented in 1 , the personnel assignment problem is of size m × n, the office layout problem is of size n 2 , the investment choice...

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

Control and systems engineering

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
Algorithm and problem complexity
Outline