Pages that link to "Item:Q2641219"
From MaRDI portal
The following pages link to An algorithm for indefinite integer quadratic programming (Q2641219):
Displaying 16 items.
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- An algorithm for solving a structured class of linear programming problems (Q1078069) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- Indefinite quadratic integer bilevel programming problem with bounded variables (Q1956480) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- (Q3115295) (← links)
- An algorithm to solve multi-objective integer quadratic programming problem (Q6596965) (← links)
