Pages that link to "Item:Q1342308"
From MaRDI portal
The following pages link to A branch and bound algorithm for solving separable convex integer programming problems (Q1342308):
Displaying 15 items.
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- A branch and bound method for solving integer separable concave problems (Q1415483) (← links)
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Solving a problem of the choice of products by means of the branch and bound method (Q2885245) (← links)
- Nonlinear integer programming for various forms of constraints (Q3325471) (← links)
- A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685) (← links)
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Q4530641) (← links)
- (Q5128175) (← links)
- An Algorithm for Separable Nonconvex Programming Problems (Q5558786) (← links)
