An auxiliary function method for global minimization in integer programming
Summary: An auxiliary function method is proposed for finding the global minimizer of integer programming problem. Firstly, we propose a method to transform the original problem into an integer programming with box constraint, which does not change the properties of the original problem. For the transformed problem, we propose an auxiliary function to escape from the current local minimizer and to get a better one. Then, based on the proposed auxiliary function, a new algorithm to find the global minimizer of integer programming is proposed. At last, numerical results are given to demonstrate the effectiveness and efficiency of the proposed method.
- A discrete dynamic convexized method for nonlinear integer programming
- A filled function method for finding a global minimizer on global integer optimization
- The auxiliary function method for resolving decision making problem
- A new discrete filled function method for finding global minimizer of the integer programming
- scientific article; zbMATH DE number 2068701
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- A filled function method for constrained nonlinear integer programming
- A filled function method for finding a global minimizer on global integer optimization
- A Greedy Heuristic for the Set-Covering Problem
- A new discrete filled function algorithm for discrete global optimization
- A new filled function method for nonlinear integer programming problem
- A simple tabu search for warehouse location
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
- Discrete filled function method for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Finding discrete global minima with a filled function for integer programming
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- Steady-state genetic algorithms for discrete optimization of trusses
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- When the greedy algorithm fails
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Parameter-free filled function method for nonlinear integer program
- The auxiliary function method for resolving decision making problem
- Parameter-free filled function approach for integer optimization problems
- A global optimal zero-forcing beamformer design with signed power-of-two coefficients
- Variable fractional delay filter design with discrete coefficients
- A discrete dynamic convexized method for nonlinear integer programming
This page was built for publication: An auxiliary function method for global minimization in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410370)
