ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

ベイズ混合整数計画法×多目的混合整数計画法×
分野シミュレーションシミュレーション
系統Process / pipelineProcess / pipeline
提唱年2018 (surrogate-BO-MIP synthesis); MIP foundations 19581980s–2000s
提唱者Baptista, R. & Poloczek, M. (formal Bayesian-BO-MIP formulation); mixed-integer programming roots in Gomory (1958)Ehrgott, M.; Mavrotas, G. and others in multi-criteria optimization
種類Surrogate-assisted combinatorial optimizationMathematical optimization
原典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 ↗Ehrgott, M. (2005). Multicriteria Optimization (2nd ed.). Springer, Berlin. ISBN: 9783540213987
別名Bayesian MIP, BO-MIP, Bayesian Combinatorial Optimization, Mixed-Integer Bayesian OptimizationMO-MIP, Multi-criteria MIP, MOMIP, Multi-objective MILP
関連55
概要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.Multi-Objective Mixed-Integer Programming (MO-MIP) is an optimization framework that simultaneously optimizes two or more conflicting objective functions subject to linear or nonlinear constraints, where some decision variables are restricted to integer values and others are continuous. It is widely applied in engineering design, supply chain planning, resource allocation, and scheduling problems that require discrete choices alongside continuous quantities.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ Download slides

ScholarGate手法を比較: Bayesian Mixed-Integer Programming · Multi-objective mixed-integer programming. 2026-06-15に以下より取得 https://scholargate.app/ja/compare