𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Introduction to Mathematical Optimization: From Linear Programming to Metaheuristics

✍ Scribed by Xin-She Yang

Year
2008
Tongue
English
Leaves
161
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ΠœΠ΅Ρ‚ΠΎΠ΄Ρ‹ ΠΎΠΏΡ‚ΠΈΠΌΠΈΠ·Π°Ρ†ΠΈΠΈ;

πŸ“œ SIMILAR VOLUMES

Matheuristics: Hybridizing Metaheuristic
πŸ“ Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
✍ Marco Caserta, Stefan Voß (auth.), Vittorio Maniezzo, Thomas StΓΌtzle, Stefan Voß πŸ“‚ Library πŸ“… 2010 πŸ› Springer US 🌐 English

<p><OL><LI>Metaheuristics: Intelligent Problem Solving</LI><P><EM>Marco Caserta and Stefan Voß</EM></P><P></P><P><LI>Just MIP it!</LI><P></P><P><EM>Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin</EM></P><P></P><P><LI>MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics</LI

Matheuristics: Hybridizing Metaheuristic
πŸ“ Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
✍ Marco Caserta, Stefan Voß (auth.), Vittorio Maniezzo, Thomas StΓΌtzle, Stefan Voß πŸ“‚ Library πŸ“… 2010 πŸ› Springer US 🌐 English

<p><OL><LI>Metaheuristics: Intelligent Problem Solving</LI><P><EM>Marco Caserta and Stefan Voß</EM></P><P></P><P><LI>Just MIP it!</LI><P></P><P><EM>Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin</EM></P><P></P><P><LI>MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics</LI

An Introduction to Metaheuristics for Op
πŸ“ An Introduction to Metaheuristics for Optimization
✍ Bastien Chopard, Marco Tomassini πŸ“‚ Library πŸ“… 2018 πŸ› Springer 🌐 English

Heuristic methods are used when rigorous ones are either unknown or cannot be applied, typically because they would be too slow. A metaheuristic is a general optimization framework that is used to control an underlying problem-specific heuristic such that the method can be easily applied to diffe

Mathematical Introduction to Linear Prog
πŸ“ Mathematical Introduction to Linear Programming and Game Theory
✍ Louis Brickman πŸ“‚ Library πŸ“… 1989 πŸ› Springer 🌐 English

Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableaus, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableaus the beautiful termination theorem of RG Bland is proven more simply than here

Mathematical Introduction to Linear Prog
πŸ“ Mathematical Introduction to Linear Programming and Game Theory
✍ Louis Brickman (auth.) πŸ“‚ Library πŸ“… 1989 πŸ› Springer-Verlag New York 🌐 English

<p>Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than h