An Auxiliary Function Method for Global Minimization in Integer Programming

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Mathematical Problems in Engineering

• Publication date

  2011-11-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1155/2011/402437
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

  2010cited by this paper
• New approach to global minimization of normal multivariate polynomial based on tensor

  2008cited by this paper
• A FILLED FUNCTION METHOD FOR BOX CONSTRAINED NONLINEAR INTEGER PROGRAMMING

  2008cited by this paper
• Finding discrete global minima with a filled function for integer programming

  2008cited by this paper
• A new discrete filled function algorithm for discrete global optimization

  2007cited by this paper
• Discrete global descent method for discrete global optimization and nonlinear integer programming

  2007cited by this paper
• A new filled function method for nonlinear integer programming problem

  2006cited by this paper
• An improved simulated annealing simulation optimization method for discrete parameter stochastic systems

  2005cited by this paper
• Discrete Filled Function Method for Discrete Global Optimization

  2005cited by this paper
• A filled function method for finding a global minimizer on global integer optimization

  2005cited by this paper
• A simple tabu search for warehouse location

  2004cited by this paper
• When the greedy algorithm fails

  2004cited by this paper
• A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems

  1999cited by this paper
• Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges

  1997cited by this paper
• Evolution strategies for solving discrete optimization problems

  1996cited by this paper
• Steady-state genetic algorithms for discrete optimization of trusses

  1995cited by this paper
• Discrete Optimization of Structures Using Genetic Algorithms

  1992cited by this paper
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality

  1986cited by this paper
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

  1982cited by this paper
• A Greedy Heuristic for the Set-Covering Problem

  1979cited by this paper

• Parameter-free filled function method for nonlinear integer program

  2022cites this paper
• A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints

  2022cites this paper
• Cost–benefit analysis of three different series–parallel dynamo configurations

  2020cites this paper
• VARIABLE FRACTIONAL DELAY FILTER DESIGN WITH

  2016cites this paper
• Design of Allpass Variable Fractional Delay Filter with Powers-of-Two Coefficients

  2015cites this paper
• Variable fractional delay filter design with discrete coefficients

  2015influential citation
• A global optimal zero-forcing beamformer design with signed power-of-two coefficients

  2015cites this paper