Pages that link to "Item:Q5906393"
From MaRDI portal
The following pages link to An approximate algorithm for nonlinear integer programming (Q5906393):
Displaying 16 items.
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- An augmented filled function for global nonlinear integer optimization (Q828743) (← links)
- A filled function method for optimal discrete-valued control problems (Q839040) (← 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)
- 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)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- New tunnel-filled function method for discrete global optimization (Q1706689) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
- Parameter-free filled function method for nonlinear integer program (Q2698601) (← links)
- Towards global solutions of optimal discrete-valued control problems (Q2857140) (← links)
- Optimal Control of Switched System with Time Delay Detection of Switching Signal (Q2913175) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)