Discrete Filled Function Method for Discrete Global Optimization
- 1 May 2005
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 31 (1) , 87-115
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Revised filled function methods for global optimizationApplied Mathematics and Computation, 2001
- Global Optimality Conditions for Quadratic Optimization Problems with Binary ConstraintsSIAM Journal on Optimization, 2000
- A continuous approach to nonlinear integer programmingApplied Mathematics and Computation, 1989
- A class of filled functions for finding global minimizers of a function of several variablesJournal of Optimization Theory and Applications, 1987
- Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingManagement Science, 1985
- Nonlinear integer programming for various forms of constraintsNaval Research Logistics Quarterly, 1982
- A Survey of Methods for Pure Nonlinear Integer ProgrammingManagement Science, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Lagrangean relaxation for integer programming1974
- On descent from local minimaMathematics of Computation, 1971