方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒整数规划× | 整数规划× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2003 | 1958 |
| 提出者≠ | Bertsimas, D. and Sim, M. | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) |
| 类型≠ | Deterministic robust optimization with integer variables | Mathematical optimisation — exact combinatorial method |
| 开创性文献≠ | Bertsimas, D., Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71. DOI ↗ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 |
| 别名≠ | RIP, Robust IP, Robust Combinatorial Optimization, Integer Robust Optimization | IP, MIP, mixed-integer programming, mixed-integer linear programming |
| 相关≠ | 6 | 4 |
| 摘要≠ | Robust Integer Programming (RIP) finds integer or binary solutions that remain feasible and near-optimal across all scenarios in a prescribed uncertainty set. Rather than assuming exact knowledge of data, RIP hedges against the worst-case realization of uncertain costs or constraint coefficients, delivering decisions that are guaranteed to perform well even when inputs deviate from their nominal values. | Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems. |
| ScholarGate数据集 ↗ |
|
|