Algorithm and problem complexity
Discrete optimization
Article REF: S7211 V1
Algorithm and problem complexity
Discrete optimization

Authors : Marie-Claude PORTMANN, Ammar OULAMARA

Publication date: December 10, 2006 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Control and systems engineering"

( 143 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