An auxiliary function method for global minimization in integer programming

DOI10.1155/2011/402437zbMath1235.90095WikidataQ58693003 ScholiaQ58693003MaRDI QIDQ410370

Xiaoli Wang, Yuping Wang, Hong-Wei Lin

Publication date: 3 April 2012

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/402437

Mathematics Subject Classification ID

90C10: Integer programming

Related Items

A global optimal zero-forcing beamformer design with signed power-of-two coefficients, Variable fractional delay filter design with discrete coefficients, Parameter-free filled function method for nonlinear integer program

Cites Work

• Unnamed Item
• A filled function method for finding a global minimizer on global integer optimization
• A simple tabu search for warehouse location
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
• A new discrete filled function algorithm for discrete global optimization
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• A filled function method for constrained nonlinear integer programming
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
• When the greedy algorithm fails
• Finding discrete global minima with a filled function for integer programming
• Discrete filled function method for discrete global optimization
• A new filled function method for nonlinear integer programming problem
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• A Greedy Heuristic for the Set-Covering Problem
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• Steady-state genetic algorithms for discrete optimization of trusses