Pages that link to "Item:Q3720299"
From MaRDI portal
The following pages link to Branch and Bound Experiments in Convex Nonlinear Integer Programming (Q3720299):
Displaying 7 items.
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
