A pegging algorithm for the nonlinear resource allocation problem

DOI10.1016/S0305-0548(00)00089-7zbMath0995.90057MaRDI QIDQ5959400

Bala Shetty, Kurt M. Bretthauer

Publication date: 3 April 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithminteger programmingconvex functionnonlinear resource allocation problempegging branch and bound algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (28)

A new exact algorithm for concave knapsack problems with integer variables ⋮ Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ Solving nested-constraint resource allocation problems with an interior point method ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Optimum component test plans for phased-mission systems ⋮ An exact algorithm for cost minimization in series reliability systems with multiple component choices ⋮ 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 ⋮ The design of optimum component test plans for system reliability ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ Capacity-constrained multiple-market price discrimination ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Resource allocation problems in decentralized energy management ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• An O(n) algorithm for quadratic knapsack problems
• Algorithms for the solution of quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• A note on a general nonlinear knapsack problem
• On the continuous quadratic knapsack problem
• Quadratic resource allocation with generalized upper bounds
• A nonlinear knapsack problem
• Algorithms for Separable Nonlinear Resource Allocation Problems
• A Parallel Projection for the Multicommodity Network Model
• Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
• Fast Approximation Algorithms for Knapsack Problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Compromise allocation in multivariate stratified sampling: An integer solution
• Multivariate Stratified Sampling by Optimization
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A Projection Method for the Integer Quadratic Knapsack Problem
• The Nonlinear Resource Allocation Problem
• Contraction Mappings in the Theory Underlying Dynamic Programming

This page was built for publication: A pegging algorithm for the nonlinear resource allocation problem