The Nonlinear Resource Allocation Problem
From MaRDI portal
Publication:4897079
DOI10.1287/opre.43.4.670zbMath0857.90090OpenAlexW1991609653MaRDI QIDQ4897079
Bala Shetty, Kurt M. Bretthauer
Publication date: 11 March 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.4.670
branch-and-boundnonlinear resource allocationconvex constraintminimization of a convex functionbounded integer variables
Related Items (36)
A new exact algorithm for concave knapsack problems with integer variables ⋮ Resource allocation in an asymmetric technology race with temporary advantages ⋮ Unnamed Item ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Some algebraic methods for solving multiobjective polynomial integer programs ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Nonconvex piecewise linear knapsack problems ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ Production and inventory management under multiple resource constraints ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ Parallel machine match-up scheduling with manufacturing cost considerations ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ On speed scaling via integer programming ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ Distance confined path problem and separable integer programming ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ Nonlinear integer programming for optimal allocation in stratified sampling
This page was built for publication: The Nonlinear Resource Allocation Problem
