Pages that link to "Item:Q2480263"

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

Displaying 33 items.

• Selfish splittable flows and NP-completeness (Q465681) (← links)
• A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
• Algorithmic problems of nontransitive (SSB) utilities (Q808974) (← links)
• Complexity and algorithms for convex network optimization and other nonlinear problems (Q816571) (← links)
• Complexity results for some global optimization problems (Q1024247) (← links)
• Optimization algorithms for a class of nonlinear programming problems (Q1105491) (← links)
• The complexity of optimization problems (Q1107309) (← links)
• Complexity of a class of nonlinear combinatorial problems related to their linear counterparts (Q1328652) (← 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)
• The complexity of approximating a nonlinear program (Q1906280) (← 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)
• (Q3132650) (← links)
• (Q4279211) (← links)
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems (Q4302594) (← links)
• Nonlinear phenomena in spaces of algorithms (Q4467341) (← links)
• A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
• Discrete Midpoint Convexity (Q5108259) (← links)
• Network Flow Optimization with Minimum Quantities (Q5232831) (← links)
• Constrained state estimation for stochastic jump systems: moving horizon approach (Q5347317) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← 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)