Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
From MaRDI portal
Publication:3602102
DOI10.1007/978-3-540-85930-7_70zbMath1155.90435MaRDI QIDQ3602102
Publication date: 12 February 2009
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85930-7_70
global optimization; nonlinear integer programming; local minimizer; Filled function; communication control
Cites Work
- Unnamed Item
- Unnamed Item
- A filled function method for finding a global minimizer on global integer optimization
- A filled function method for finding a global minimizer of a function of several variables
- Finding global minimizer with one-parameter filled function on unconstrained global optimization
- New classes of globally convexized filled functions for global optimization
- The globally convexized filled functions for global optimization
- A continuous approach to nonlinear integer programming
- Finding discrete global minima with a filled function for integer programming
- The Tunneling Algorithm for the Global Minimization of Functions