An auxiliary function method for global minimization in integer programming
From MaRDI portal
Publication:410370
DOI10.1155/2011/402437zbMATH Open1235.90095OpenAlexW2094779604WikidataQ58693003 ScholiaQ58693003MaRDI QIDQ410370FDOQ410370
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
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
- scientific article; zbMATH DE number 2068701
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- A simple tabu search for warehouse location
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Title not available (Why is that?)
- Discrete filled function method for discrete global optimization
- Steady-state genetic algorithms for discrete optimization of trusses
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- A filled function method for constrained nonlinear integer programming
- 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
- A new filled function method for nonlinear integer programming problem
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- A filled function method for finding a global minimizer on global integer optimization
- A new discrete filled function algorithm for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
Cited In (5)
- The auxiliary function method for resolving decision making problem
- A global optimal zero-forcing beamformer design with signed power-of-two coefficients
- A discrete dynamic convexized method for nonlinear integer programming
- Parameter-free filled function method for nonlinear integer program
- Variable fractional delay filter design with discrete coefficients
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)
