An auxiliary function method for global minimization in integer programming

DOI10.1155/2011/402437MaRDI QIDQ410370zbMATHOpenAlexWikidataFDO

Authors Yuping Wang, Xiaoli Wang, Hongwei 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

Integer programming (90C10)

Recommendations

• 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
• Publication:4465182

Cites work

• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• 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 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
• 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

Cited in

(5)

• The auxiliary function method for resolving decision making problem
• A discrete dynamic convexized method for nonlinear integer programming
• 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

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)