Pages that link to "Item:Q3757685"

The following pages link to A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685):

Displaying 27 items.

• Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
• An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• Nonlinear integer programming algorithms: A survey (Q1082264) (← links)
• Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075) (← links)
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993) (← links)
• Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
• An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
• An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
• A branch and bound method for solving integer separable concave problems (Q1415483) (← links)
• A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
• Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
• Nonlinear integer programming for various forms of constraints (Q3325471) (← links)
• An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
• (Q3596895) (← links)
• (Q3740574) (← links)
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Q4530641) (← links)
• (Q4939281) (← links)
• A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
• (Q5128175) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)