A new filled function method for nonlinear integer programming problem

DOI10.1016/j.amc.2005.04.025zbMath1091.65055MaRDI QIDQ2489450

Yanyan Li

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.025

zbMATH Keywords

algorithms; integer programming; numerical examples; filled function method; NP-hard problems; discrete global minimizer

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C30: Nonlinear programming

Related Items

A filled function method for quadratic programs with binary constraints†, An auxiliary function method for global minimization in integer programming, 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 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, Towards global solutions of optimal discrete-valued control problems, Optimal Control of Switched System with Time Delay Detection of Switching Signal, History and Prospects for First-Order Automated Deduction

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More test examples for nonlinear programming codes
• A Monte-Carlo approach for 0-1 programming problems
• Heuristic methods and applications: A categorized survey
• A continuous approach to nonlinear integer programming
• Testing Unconstrained Optimization Software
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• An approximate algorithm for nonlinear integer programming
• An approximate algorithm for nonlinear integer programming