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

DOI10.1002/NAV.3800330403zbMATH Open0619.90049OpenAlexW2084927502MaRDI QIDQ3757685FDOQ3757685

S. Selcuk Erenguc, A. Victor Cabot

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

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

zbMATH Keywords

branch and boundnonlinear integer programmingconcave functionspenaltiesseparable objective functioncontinuous linear subproblems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (27)

• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Non-linear integer programming: Sensitivity analysis for branch and bound
• A general purpose exact solution method for mixed integer concave minimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A branch and bound method for solving integer separable concave problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Capacity planning in networks of queues with manufacturing applications
• Title not available (Why is that?)
• A branch and bound algorithm for solving separable convex integer programming problems
• 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
• Title not available (Why is that?)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems
• An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• A branch and bound algorithm for solving a class of D-C programming
• Nonlinear integer programming algorithms: A survey
• A new exact algorithm for concave knapsack problems with integer variables
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming 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)