Pages that link to "Item:Q2675735"

The following pages link to Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735):

Displaying 10 items.

• The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
• An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
• Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
• An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (Q2774597) (← links)
• Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
• (Q4602398) (← links)
• On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)