A continuous approach to nonlinear integer programming

DOI10.1016/0096-3003(89)90005-2zbMath0682.90067OpenAlexW2041249887MaRDI QIDQ1824556

Changbin Huang, Renpu Ge

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0096-3003(89)90005-2

zbMATH Keywords

global optimizationnonlinear integer programmingfilled function transformation method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items (27)

History and Prospects for First-Order Automated Deduction ⋮ A parallel global optimization algorithm for rational separable- factorable functions ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ A novel convergent filled function algorithm for multi-dimensional global optimization ⋮ Gradient-type methods: a unified perspective in computer science and numerical analysis ⋮ Open issues and recent advances in DC programming and DCA ⋮ A new discrete filled function method for solving large scale max-cut problems ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Weighted Optimization with Thresholding for Complete-Case Analysis ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A continuous approach to combinatorial optimization: application of water system pump operations ⋮ Discrete filled function method for discrete global optimization ⋮ An approximate algorithm for nonlinear integer programming ⋮ A new filled function method for nonlinear integer programming problem ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ A filled function method for finding a global minimizer on global integer optimization ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem ⋮ A revised cut-peak function method for box constrained continuous global optimization ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ A DC Programming Approach for Mixed-Integer Linear Programs ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ A parallel computing scheme for minimizing a class of large scale functions ⋮ A note on ``A continuous approach to nonlinear integer programming

Cites Work

• Unnamed Item
• A class of filled functions for finding global minimizers of a function of several variables
• Nonlinear integer programming algorithms: A survey
• What makes integer programming problems hard to solve: An empirical study
• The globally convexized filled functions for global optimization
• An Automatic Method of Solving Discrete Programming Problems
• Nonlinear integer programming for various forms of constraints
• Some NP-complete problems in quadratic and nonlinear programming
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Experiments in mixed-integer linear programming

This page was built for publication: A continuous approach to nonlinear integer programming