A branch and bound algorithm for solving a class of nonlinear integer programming problems

DOI10.1002/NAV.3800330403MaRDI QIDQ3757685zbMATHOpenAlexFDO

Authors A. Victor Cabot, S. Selcuk Erenguc

Publication date 1986

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800330403

zbMATH Keywords

branch and boundnonlinear integer programmingconcave functionspenaltiesseparable objective functioncontinuous linear subproblems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• A branch and bound algorithm for solving separable convex integer programming problems
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• Nonlinear integer programming algorithms: A survey
• A branch and bound algorithm for integer separable concave programs
• Branch and Bound Experiments in Convex Nonlinear Integer Programming

Cites work

• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

Cited in

(32)

• A new exact algorithm for concave knapsack problems with integer variables
• A branch and bound algorithm for integer separable concave programs
• A branch and bound algorithm for solving separable convex integer programming problems
• A branch and bound algorithm for solving a class of D-C programming
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• scientific article; zbMATH DE number 7267266 (Why is no real title available?)
• Nonlinear integer programming algorithms: A survey
• A general purpose exact solution method for mixed integer concave minimization problems
• Nonlinear integer programming
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
• An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
• Nonlinear integer programming for various forms of constraints
• scientific article; zbMATH DE number 1406243 (Why is no real title available?)
• Capacity planning in networks of queues with manufacturing applications
• scientific article; zbMATH DE number 4037605 (Why is no real title available?)
• scientific article; zbMATH DE number 3974726 (Why is no real title available?)
• scientific article; zbMATH DE number 5503918 (Why is no real title available?)
• A branch and bound method for solving integer separable concave problems
• A branch and bound algorithm for a class of non-convex programming problems
• Non-linear integer programming: Sensitivity analysis for branch and bound
• An improved branch and bound algorithm for mixed integer nonlinear programs
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• Dual approaches for a specific class of integer nonlinear programming problems
• scientific article; zbMATH DE number 4139490 (Why is no real title available?)
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems

This page was built for publication: A branch and bound algorithm for solving a class of nonlinear integer programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757685)