Pages that link to "Item:Q1170996"

The following pages link to Solving certain singly constrained convex optimization problems in production planning (Q1170996):

Displaying 14 items.

• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
• On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• A note on multi-item inventory systems with limited capacity (Q1102170) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• Multi-period resource allocation for estimating project costs in competitive bidding (Q2401316) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Production and inventory management under multiple resource constraints (Q2476693) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
• Competitive Resource Allocation Among Urban Congestion Areas in a Modern Big City (Q6495225) (← links)