Pages that link to "Item:Q4897079"

The following pages link to The Nonlinear Resource Allocation Problem (Q4897079):

Displaying 50 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Stochastic nonlinear resource allocation problem (Q325428) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
• Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
• On speed scaling via integer programming (Q1785426) (← links)
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
• Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
• Demand allocation with latency cost functions (Q2429466) (← links)
• A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Production and inventory management under multiple resource constraints (Q2476693) (← links)
• Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique (Q2483337) (← links)
• Ant colony optimization for the nonlinear resource allocation problem (Q2489380) (← links)
• On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
• An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
• Algorithms for separable nonlinear resource allocation problems (Q2770087) (← links)
• Distance confined path problem and separable integer programming (Q2841138) (← links)
• Utilizing the surrogate dual bound in capacity planning with economies of scale (Q2867324) (← links)
• Resource allocation in an asymmetric technology race with temporary advantages (Q3166686) (← links)
• A Min-Max-Sum Resource Allocation Problem and Its Applications (Q3635044) (← links)
• Bounded Linear Allocation With A Nonlinear Cost Constraint Is An Unconstrained Problem (Q3773710) (← links)
• Generalized Assignment with Nonlinear Capacity Interaction (Q3830817) (← links)
• COMPUTING OPTIMAL ALLOCATIONS FOR DISCRETE‐TIME NONLINEAR NATURAL RESOURCE MODELS (Q4248888) (← links)
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems (Q4302594) (← links)
• Bottleneck Resource Allocation in Manufacturing (Q4363727) (← links)
• A specially structured nonlinear integer resource allocation problem (Q4456095) (← links)
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
• (Q4945105) (← links)
• A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
• Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
• An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
• A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach (Q6099458) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)