An approximate algorithm for nonlinear integer programming

DOI10.1016/0377-2217(94)90215-1zbMath0803.90094OpenAlexW2028104204MaRDI QIDQ5906559

No author found.

Publication date: 21 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90215-1

zbMATH Keywords

heuristicsnonlinear integer programmingapproximate algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items

A hybrid approach to resolving a differentiable integer program. ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ An approximate algorithm for nonlinear integer programming ⋮ A new filled function method for nonlinear integer programming problem ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

Cites Work

• Unnamed Item
• An algorithm of internal feasible directions for linear integer programming
• Heuristic methods and applications: A categorized survey
• Integer solutions of systems of quadratic equations
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints