Pages that link to "Item:Q1396998"

The following pages link to An optimal bound for d. c. programs with convex constraints (Q1396998):

Displaying 8 items.

• Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• Equity models in planar location (Q871686) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
• An algorithm for bounded-error identification of nonlinear systems based on DC functions (Q2440614) (← links)
• Location of a distribution center for a perishable product (Q2636926) (← links)
• A note on equity across groups in facility location (Q2892131) (← links)
• Big segment small segment global optimization algorithm on networks (Q3113501) (← links)