Pages that link to "Item:Q5933815"
From MaRDI portal
The following pages link to \(p\)th power Lagrangian method for integer programming (Q5933815):
Displaying 14 items.
- Identifying a global optimizer with filled function for nonlinear integer programming (Q659491) (← links)
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints (Q693550) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Towards strong duality in integer programming (Q2501114) (← links)
- Generalized nonlinear Lagrangian formulation for bounded integer programming (Q2583181) (← links)
- Strong duality in optimization: shifted power reformulation (Q2829558) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION (Q5472778) (← links)
