Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| Vegyes egészértékű programozás× | Branch and Bound× | |
|---|---|---|
| Tudományterület≠ | Szimuláció | Optimalizálás |
| Módszercsalád | Process / pipeline | Process / pipeline |
| Keletkezés éve≠ | 1958–1960 | 1960 |
| Megalkotó≠ | Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960) | Ailsa Land & Alison Doig |
| Típus≠ | Mathematical optimization | Exact combinatorial optimization algorithm |
| Alapmű≠ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York. ISBN: 9780471359432 | Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497–520. DOI ↗ |
| Alternatív nevek | MIP, Mixed-Integer Linear Programming, MILP, Integer Programming | B&B, Land-Doig Algorithm, Implicit Enumeration, Dal ve Sınır |
| Kapcsolódó≠ | 6 | 3 |
| Összefoglaló≠ | Mixed-Integer Programming (MIP) is a mathematical optimization framework in which some decision variables must take integer values while others may be continuous. It generalizes linear programming and is widely used in operations research, logistics, scheduling, resource allocation, and engineering design, where indivisibility constraints — such as yes/no decisions or whole-unit quantities — arise naturally. | Branch and Bound is a systematic exact algorithm for combinatorial and integer optimization problems, introduced by Ailsa Land and Alison Doig in 1960. It organizes the search space as a tree of subproblems, uses relaxation-derived upper bounds to prune branches that cannot improve the best known solution, and guarantees finding a globally optimal integer solution. It is the backbone of modern mixed-integer programming solvers used in operations research, logistics, scheduling, and engineering design. |
| ScholarGateAdatkészlet ↗ |
|
|