Pages that link to "Item:Q2480263"

The following pages link to Complexity and algorithms for nonlinear optimization problems (Q2480263):

Displaying 17 items.

• Selfish splittable flows and NP-completeness (Q465681) (← links)
• A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• Optimal procurement and production planning for multi-product multi-stage production under yield uncertainty (Q1713747) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• A heuristic method for the supplier selection and order quantity allocation problem (Q2241824) (← links)
• Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
• A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
• Discrete Midpoint Convexity (Q5108259) (← links)
• Resource allocation problems with expensive function evaluations (Q6106771) (← links)
• A complex-valued gradient flow for the entangled bipartite low rank approximation (Q6156953) (← links)
• Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)