A discrete dynamic convexized method for nonlinear integer programming
From MaRDI portal
Publication:953398
DOI10.1016/j.cam.2008.01.023zbMath1156.65065OpenAlexW1977854849MaRDI QIDQ953398
Publication date: 20 November 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.01.023
algorithmconvergencebox constrained nonlinear integer programmingconvexized methoddiscrete local minimizer
Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)
Related Items
An effective discrete dynamic convexized method for solving the winner determination problem ⋮ An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ A discrete dynamic convexized method for the max-cut problem ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Weighted Differentiation Composition Operators from Mixed-Norm to Zygmund Spaces ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming ⋮ A note on ``A continuous approach to nonlinear integer programming ⋮ A discrete dynamic convexized method for VLSI circuit partitioning
Cites Work
- A filled function method for finding a global minimizer on global integer optimization
- An exact penalty function approach for nonlinear integer programming problems
- On the investigation of stochastic global optimization algorithms
- A filled function method for finding a global minimizer of a function of several variables
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- A Monte-Carlo approach for 0-1 programming problems
- General local search methods
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A branch and bound algorithm for solving separable convex integer programming problems
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- The globally convexized filled functions for global optimization
- A continuous approach to nonlinear integer programming
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Integral global minimization: Algorithms, implementations and numerical tests
- A note on adapting methods for continuous global optimization to the discrete case
- Discrete filled function method for discrete global optimization
- A new filled function method for nonlinear integer programming problem
- An integrated plant loading model with economies of scale and scope
- An algorithm for indefinite integer quadratic programming
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- The Tunneling Algorithm for the Global Minimization of Functions
- Methods of Nonlinear 0-1 Programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An efficient algorithm to solve integer-programming problems arising in system-reliability design
- Calculation of Investment Portfolios with Risk Free Borrowing and Lending
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
