Pages that link to "Item:Q5928425"
From MaRDI portal
The following pages link to Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. (Q5928425):
Displayed 17 items.
- 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)
- An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← 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)
- Exact penalty function and asymptotic strong nonlinear duality in integer programming (Q1780321) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← 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)
- (Q5021865) (← links)
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION (Q5472778) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)