用户名： 密码： 验证码：
常用资源电子图书期刊论文学位会议外文资源特色专题内部出版物 
中国地质文献-英文(2)SpringerLink电子期刊(2821)GSW全文库(13)
Wiley电子期刊(31)ProQuest学位论文(210)Elsevier电子期刊(10334)
Springer电子图书(16)NATURE电子期刊(10)ACS电子期刊(26)
在“Springer电子图书”中，命中：16条，耗时：0.0329847 秒

在所有数据库中总计命中：13,463条

2.<b>Branch and price: Integer programming with column generation; Convex-simplex algorithm; Decomposition techniques for MILP: Lagrangian relaxation; Equivalence between nonlinear complementarity problem and fixed point problem; Generalized nonlinear complementarity problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Lemke method; Linear complementarity problem; Linear programming; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multiparametric mixed integer linear programming; Order complementarity; Parametric linear programming: Cost simplex algorithm; Parametric mixed integer nonlinear optimization; Principal pivoting methods for li
ContentType：Reference Work Entry
Publisher：Springer US
3.<b>Equality-constrained nonlinear programming: KKT necessary optimality conditions; Inequality-constrained nonlinear optimization; Kuhn–Tucker optimality conditions; Lagrangian duality: Basics; Rosen's method, global convergence, and Powell's conjecture; Saddle point theory and optimality conditions; Second order constraint qualifications; Second order optimality conditions for nonlinear optimization</b><b>Equality-constrained nonlinear programming: KKT necessary optimality conditions; Inequality-constrained nonlinear optimization; Kuhn–Tucker optimality conditions; Lagrangian duality: Basics; Nondifferentiable optimization: Parametric programming; Rosen's method, global convergence, and Powell's conjecture; Saddle point theory and optimality conditions; Second order constraint qualifications; Second order optimality conditions for nonlinear optimization</b>FIRST ORDER CONSTRAINT QUALIFICATIONS
ContentType：Reference Work Entry
Publisher：Springer US
6.<b>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: Cutting plane algorithms; Integer programming duality; Lagrange, Joseph-Louis; Lagrangian multipliers methods for convex programming; LCP: Pardalos–Rosen mixed integer formulation; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multi-objective optimization: Lagrange duality; Multiparametric mixed integer linear programming; 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 program
ContentType：Reference Work Entry
Publisher：Springer US
7.<b>Airline optimization; Alignment problem; Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Graph coloring; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane algorithms; Integer programming duality; Integer programming: Lagrangian relaxation; LCP: Pardalos–Rosen mixed integer formulation; Maximum satisfiability problem; Mixed integer classification problems; Multi-objective integer linear programming; Multi-objective mixed integer programming; Multidimensional knapsack problems; Multiparametric mixed integer linear programming; Optimization in leveled graphs; Parametric mixed integer nonlinear optimization; Quadratic knapsack; Set covering, packing and partitioning problems; Simplicial pivoting algorithms for integer programming: Stochasti
ContentType：Reference Work Entry
Publisher：Springer US
8.<b>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: Cutting plane 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; 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</b> INTEGER PROGRAMMING: BRANCH AND CUT ALGORITHMS
ContentType：Reference Work Entry
Publisher：Springer US
9.<b>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</b> INTEGER PROGRAMMING: CUTTING PLANE AL
ContentType：Reference Work Entry
Publisher：Springer US
10.<b>Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Branch and bound methods; Integer programming: Branch and cut algorithms; Integer programming: Cutting plane 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; 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</b> INTEGER PROGRAMMING: ALGEBRAIC METHODS
ContentType：Reference Work Entry
Publisher：Springer US
1
2
按检索点细分(16)
Name(15)

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址：北京市海淀区学院路29号 邮编：100083

电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700