Pages that link to "Item:Q3440214"
From MaRDI portal
The following pages link to Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function (Q3440214):
Displaying 10 items.
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
