Pages that link to "Item:Q1090621"

The following pages link to The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621):

Displaying 15 items.

• Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
• Lower subdifferentiability of quadratic functions (Q688922) (← links)
• Fractional programming by lower subdifferentiability techniques (Q911479) (← links)
• Sets of efficient points in a normed space (Q1084331) (← links)
• Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
• Localization in multifacility location theory (Q1095778) (← links)
• GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
• When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
• Efficiency in constrained continuous location (Q1291655) (← links)
• Dominating sets for convex functions with some applications (Q1389077) (← links)
• Generalized fractional programming and cutting plane algorithms (Q1906751) (← links)
• A characterization of efficient points in constrained location problems with regional demand (Q2564626) (← links)
• Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
• Weak lower subdifferentials and applications (Q3200118) (← links)
• Lower subdifferentiability in minimax fractional programming^* (Q4265513) (← links)