An approximate algorithm for nonlinear integer programming

DOI10.1016/S0096-3003(97)10083-2zbMath0938.90052MaRDI QIDQ5906393

Wen-Xing Zhu

Publication date: 14 May 2000

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

filled function method; discrete local minimal solution; nonlinear integral programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C30: Nonlinear programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A filled function method for quadratic programs with binary constraints†, A new discrete filled function method for solving large scale max-cut problems, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, A filled function method for optimal discrete-valued control problems, Discrete global descent method for discrete global optimization and nonlinear integer programming, Discrete global optimization problems with a modified discrete filled function, A discrete filled function algorithm for approximate global solutions of max-cut problems, A discrete dynamic convexized method for nonlinear integer programming, Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming, Discrete filled function method for discrete global optimization, A new filled function method for nonlinear integer programming problem, Towards global solutions of optimal discrete-valued control problems, Optimal Control of Switched System with Time Delay Detection of Switching Signal

Cites Work

• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer of a function of several variables
• A Monte-Carlo approach for 0-1 programming problems
• Heuristic methods and applications: A categorized survey
• A continuous approach to nonlinear integer programming
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• An approximate algorithm for nonlinear integer programming