Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Deterministisk heltalsoptimering× | Branch and Bound× | |
|---|---|---|
| Ämnesområde≠ | Simulering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1958 | 1960 |
| Upphovsperson≠ | Ralph E. Gomory | Ailsa Land & Alison Doig |
| Typ≠ | Exact combinatorial optimization | Exact combinatorial optimization algorithm |
| Ursprungskälla≠ | Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275-278. DOI ↗ | Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497–520. DOI ↗ |
| Alias | DIP, Integer Programming, IP, Integer Linear Programming | B&B, Land-Doig Algorithm, Implicit Enumeration, Dal ve Sınır |
| Närliggande≠ | 5 | 3 |
| Sammanfattning≠ | Deterministic Integer Programming (DIP) is a mathematical optimization approach that finds the best solution to problems where some or all decision variables must take integer values, given fully known (deterministic) objective and constraint data. It is the classical, non-stochastic form of integer programming, foundational to operations research and combinatorial optimization since the late 1950s. | 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. |
| ScholarGateDatamängd ↗ |
|
|