방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 혼합 정수 계획법× | 강건 혼합 정수 계획법× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 2018 (surrogate-BO-MIP synthesis); MIP foundations 1958 | 1998–2004 |
| 창시자≠ | Baptista, R. & Poloczek, M. (formal Bayesian-BO-MIP formulation); mixed-integer programming roots in Gomory (1958) | Ben-Tal & Nemirovski; Bertsimas & Sim |
| 유형≠ | Surrogate-assisted combinatorial optimization | Deterministic robust reformulation of MIP under uncertainty |
| 원전≠ | Baptista, R., Poloczek, M. (2018). Bayesian Optimization of Combinatorial Structures. Proceedings of the 35th International Conference on Machine Learning (ICML), PMLR 80:462–471. link ↗ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ |
| 별칭 | Bayesian MIP, BO-MIP, Bayesian Combinatorial Optimization, Mixed-Integer Bayesian Optimization | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP |
| 관련≠ | 5 | 4 |
| 요약≠ | Bayesian Mixed-Integer Programming (BO-MIP) couples a probabilistic surrogate model — typically a Gaussian process — with a mixed-integer programming solver to efficiently optimize expensive black-box objectives defined over spaces that contain both continuous and discrete or integer-valued decision variables. It is especially valuable when each function evaluation is costly and exhaustive search is infeasible. | Robust Mixed-Integer Programming (RMIP) combines mixed-integer programming with robust optimization to find solutions that remain feasible and near-optimal despite uncertain parameters. Instead of assuming fixed data, it protects decisions against adversarial or worst-case realizations of uncertain inputs, using an explicit uncertainty set to control the degree of conservatism while preserving the combinatorial structure of integer decisions. |
| ScholarGate데이터셋 ↗ |
|
|