Finding discrete global minima with a filled function for integer programming
From MaRDI portal
Publication:2477662
DOI10.1016/j.ejor.2007.05.028zbMath1152.90541MaRDI QIDQ2477662
Lian-Sheng Zhang, You-lin Shang
Publication date: 14 March 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.05.028
90C10: Integer programming
Related Items
An auxiliary function method for global minimization in integer programming, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Discrete global optimization problems with a modified discrete filled function, Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A filled function method for finding a global minimizer on global integer optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A filled function method for finding a global minimizer of a function of several variables
- A class of filled functions for finding global minimizers of a function of several variables
- More test examples for nonlinear programming codes
- The globally convexized filled functions for global optimization
- Heuristic methods and applications: A categorized survey
- A continuous approach to nonlinear integer programming
- Several filled functions with mitigators.
- Integral global minimization: Algorithms, implementations and numerical tests
- Discrete filled function method for discrete global optimization
- Nonlinear integer programming for various forms of constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- An approximate algorithm for nonlinear integer programming
- A new filled function method for global optimization
- Filled functions for unconstrained global optimization.
- A class of generalized filled functions with improved computability
