Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
From MaRDI portal
Publication:1017442
DOI10.1016/j.cor.2008.12.002zbMath1160.90598OpenAlexW2029914982WikidataQ57932036 ScholiaQ57932036MaRDI QIDQ1017442
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.002
Related Items (5)
An effective discrete dynamic convexized method for solving the winner determination problem ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ A discrete dynamic convexized method for the max-cut problem ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ A discrete dynamic convexized method for VLSI circuit partitioning
Cites Work
- Unnamed Item
- Unnamed Item
- An exact penalty function approach for nonlinear integer programming problems
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A discrete dynamic convexized method for nonlinear integer programming
- A Monte-Carlo approach for 0-1 programming problems
- 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
- A note on adapting methods for continuous global optimization to the discrete case
- Discrete filled function method for discrete global optimization
- An algorithm for indefinite integer quadratic programming
- Genetic Algorithms for Solving a Class of Constrained Nonlinear Integer Programs
- An efficient algorithm to solve integer-programming problems arising in system-reliability design
- Reliability Optimization Problems with Multiple Constraints
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
This page was built for publication: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming