An enumerative algorithm framework for a class of nonlinear integer programming problems
From MaRDI portal
Publication:1278943
DOI10.1016/S0377-2217(96)00164-6zbMath0929.90057MaRDI QIDQ1278943
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
eigenvalueenumeration treebranch-and-search algorithmdual surrogate problemlinearly constrained, quadratic integer programmingnonseparable quadratic concave function
Related Items
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming ⋮ Finding multiple solutions to general integer linear programs ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ A simple procedure for solving a continuous quadratic mathematical model. ⋮ A branch and bound algorithm for designing reliable systems at a minimum cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Computer experiments on quadratic programming algorithms
- Nonlinear 0–1 programming: I. Linearization techniques
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Calculating surrogate constraints
- Surrogate Constraint Duality in Mathematical Programming
- Optimal Reliability Allocation by Branch-and-Bound Technique
- The Age of Optimization: Solving Large-Scale Real-World Problems
- Surrogate Constraints
- Duality in Discrete Programming: II. The Quadratic Case
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
This page was built for publication: An enumerative algorithm framework for a class of nonlinear integer programming problems