An approximate algorithm for nonlinear integer programming

DOI10.1016/S0096-3003(97)10083-2MaRDI QIDQ5906393zbMATH OpenFDO

Authors Wenxing Zhu

Publication date 14 May 2000

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

Full work available at URL https://doi.org/10.1016/S0096-3003(97)10083-2

zbMATH Keywords

discrete local minimal solutionfilled function methodnonlinear integral programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximate algorithm for nonlinear integer programming
• scientific article; zbMATH DE number 3978825
• scientific article; zbMATH DE number 3976781
• scientific article; zbMATH DE number 1854236
• scientific article; zbMATH DE number 3511865
• The approximation algorithm for solving a sort of non-smooth programming
• scientific article; zbMATH DE number 3847219
• Nonlinear integer programming algorithms: A survey
• Approximation methods for problems of nonlinear programming
• scientific article; zbMATH DE number 3972639

Cites work

• A continuous approach to nonlinear integer programming
• A filled function method for finding a global minimizer of a function of several variables
• A Monte-Carlo approach for 0-1 programming problems
• An approximate algorithm for nonlinear integer programming
• Heuristic methods and applications: A categorized survey
• scientific article; zbMATH DE number 3821078 (Why is no real title available?)
• scientific article; zbMATH DE number 3793783 (Why is no real title available?)
• 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

Cited in

(35)

• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• A note on ``A continuous approach to nonlinear integer programming
• A heuristic algorithm for nonlinear programming
• Algorithms for nonlinear integer bicriterion problems
• An approximate method for local optima for nonlinear mixed integer programming problems
• Basic hardware module for a nonlinear programming algorithm and applications
• A hybrid approach to resolving a differentiable integer program.
• New tunnel-filled function method for discrete global optimization
• Implementation of the Nielsen algorithm in the algebraic programming system APS-1
• The complexity of approximating a nonlinear program
• Discrete filled function method for discrete global optimization
• A new filled function method for nonlinear integer programming problem
• Parameter-free filled function method for nonlinear integer program
• Towards global solutions of optimal discrete-valued control problems
• Optimal Control of Switched System with Time Delay Detection of Switching Signal
• scientific article; zbMATH DE number 3976781 (Why is no real title available?)
• scientific article; zbMATH DE number 3978825 (Why is no real title available?)
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• scientific article; zbMATH DE number 1123971 (Why is no real title available?)
• A new discrete filled function method for solving large scale max-cut problems
• scientific article; zbMATH DE number 2068701 (Why is no real title available?)
• Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
• A filled function method for quadratic programs with binary constraints†
• scientific article; zbMATH DE number 6460215 (Why is no real title available?)
• An approximate algorithm for nonlinear integer programming
• An algorithm for non-linear multi-level integer programming problems
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
• Parameter-free filled function approach for integer optimization problems
• An augmented filled function for global nonlinear integer optimization
• 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

This page was built for publication: An approximate algorithm for nonlinear integer programming

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