Pages that link to "Item:Q1110993"
From MaRDI portal
The following pages link to A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993):
Displaying 14 items.
- Identifying a global optimizer with filled function for nonlinear integer programming (Q659491) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- On duality for Boolean programming (Q750292) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- Discrete global optimization problems with a modified discrete filled function (Q888308) (← links)
- Some branch and bound techniques for nonlinear optimization (Q1100098) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- Solving mixed integer nonlinear programs by outer approximation (Q1337138) (← links)
- A new bounding technique in branch-and-bound algorithms for mixed integer programming (Q1384440) (← links)
- Localization of solutions of some problems of nonlinear integer optimization (Q1842400) (← links)
- Logarithmic-exponential penalty formulation for integer programming (Q1961727) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685) (← links)
