Pages that link to "Item:Q2757656"
From MaRDI portal
The following pages link to Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation (Q2757656):
Displaying 11 items.
- 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)
- Exact penalty function and asymptotic strong nonlinear duality in integer programming (Q1780321) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← 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)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION (Q5472778) (← links)
- General exact penalty functions in integer programming (Q5717384) (← links)
