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...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Algorithm and problem complexity
Article included in this offer
"Control and systems engineering"
(
143 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
References
- (1) - - Dash Optimization. http://www.dashoptimization.com
- (2) - FAURE (R.), LEMAIRE (B.), PICOULEAU (C.) - Précis de recherche opérationnelle : Méthodes et exercices. - Dunod, Collection Sciences...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!