Combinatorial optimization
Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory.
Related Topics:
Optimization - Applied mathematics - Computer science - Operations research - Algorithm - Computational complexity theory
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
Sometimes it is called "discrete optimization", however the latter term is considered to be somewhat different.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | Informal definition |
| ► | Formal definition |
| ► | Examples |
| ► | Methods |
| ► | References |
| ► | Journals |
~ What's Hot ~
Twilight, Madagascar 3, All About Steve, The Blind Side, The Princess And The Frog, Alvin And The Chipmunks The Squeakquel, Legion, The Goods Live Hard Sell Hard, New Moon, A Nightmare On Elm Street, Clash Of The Titans, The Ugly Truth, The Hangover, The Karate Kid, My Sister S Keeper, Avatar, 500 Days Of Summer, The Mummy 4 Rise Of The Aztec, Dear John, Up In The Air,
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.