Finding discrete global minima with a filled function for integer programming
From MaRDI portal
Recommendations
- A filled function method for finding a global minimizer on global integer optimization
- A new discrete filled function method for finding global minimizer of the integer programming
- Finding global minima with a computable filled function.
- scientific article; zbMATH DE number 1558263
- A filled function method with one parameter for integer programming
Cites work
- A class of filled functions for finding global minimizers of a function of several variables
- A class of generalized filled functions with improved computability
- A continuous approach to nonlinear integer programming
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for finding a global minimizer on global integer optimization
- A new filled function method for global optimization
- An approximate algorithm for nonlinear integer programming
- Discrete filled function method for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Filled functions for unconstrained global optimization.
- Heuristic methods and applications: A categorized survey
- scientific article; zbMATH DE number 3821078 (Why is no real title available?)
- scientific article; zbMATH DE number 1558263 (Why is no real title available?)
- scientific article; zbMATH DE number 5056297 (Why is no real title available?)
- Integral global minimization: Algorithms, implementations and numerical tests
- More test examples for nonlinear programming codes
- Nonlinear integer programming for various forms of constraints
- Several filled functions with mitigators.
- The globally convexized filled functions for global optimization
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Cited in
(19)- New tunnel-filled function method for discrete global optimization
- Filled function method to optimize supply chain transportation costs
- A new discrete filled function method for finding global minimizer of the integer programming
- Parameter-free filled function method for nonlinear integer program
- Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem
- An auxiliary function method for global minimization in integer programming
- A new parameter free filled function for solving unconstrained global optimization problems
- A new filled function for global minimization and system of nonlinear equations
- A filled function method with one parameter for integer programming
- A filled function method for finding a global minimizer on global integer optimization
- A new filled function method for unconstrained global optimization
- A novel convergent filled function algorithm for multi-dimensional global optimization
- A novel one-parameter filled function method with an application to pathological analysis
- A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
- A class of one-parameter filled functions with the same local minima as the objective function for global optimization problems
- A novel single-parameter continuously differentiable filled function for global optimization
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- Parameter-free filled function approach for integer optimization problems
- Discrete global optimization problems with a modified discrete filled function
This page was built for publication: Finding discrete global minima with a filled function for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477662)
