Pages that link to "Item:Q3325471"
From MaRDI portal
The following pages link to Nonlinear integer programming for various forms of constraints (Q3325471):
Displaying 13 items.
- Identifying a global optimizer with filled function for nonlinear integer programming (Q659491) (← links)
- A dynamic programming algorithm for multiple-choice constraints (Q798257) (← links)
- Nonlinear integer programming algorithms: A survey (Q1082264) (← links)
- Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming (Q1111468) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- Nonlinear integer goal programming (Q1283613) (← links)
- A continuous approach to nonlinear integer programming (Q1824556) (← links)
- Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Generalized nonlinear Lagrangian formulation for bounded integer programming (Q2583181) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Solving nonlinear programming problems with very many constraints (Q4327941) (← links)