Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; NP-complete problems and proof methodology; Parametric mixed integer nonlinear optimization; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming; Stochastic integer programming: Continuity, stability, rates of convergence; Stochastic integer programs; Time-dependent traveling salesman problem INTEGER PROGRAMMING: CUTTING PLANE ALGORITHMS

作者

John E. Mitchell

出处

期刊：Encyclopedia of Optimization 日期：2001-01-01 卷期号：: 1065-1073

标识

DOI：10.1007/0-306-48332-7_216

求助该文献

相关文献

科研通AI机器人已完成分析

对不起，本页面需要您登录以后才可查看

进入登录/注册页面