Pages that link to "Item:Q2487474"
From MaRDI portal
The following pages link to Discrete filled function method for discrete global optimization (Q2487474):
Displayed 13 items.
- An auxiliary function method for global minimization in integer programming (Q410370) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Identifying a global optimizer with filled function for nonlinear integer programming (Q659491) (← links)
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
- Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
- Tracking control of linear switched systems (Q3505055) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)