Solution techniques for some allocation problems

DOI10.1007/BF02591716zbMath0492.90053MaRDI QIDQ3955156

Paul Zipkin, Awi Federgruen

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

approximation methodallocation problemssolution techniquesgeneralized upper boundsconvex knapsack problemsnovel data structures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities ⋮ DYNAMIC OPTIMAL BUDGET ALLOCATION FOR INTEGRATED MARKETING CONSIDERING PERSISTENCE ⋮ Resource allocation among competing activities: A lexicographic minimax approach ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Quadratic resource allocation with generalized upper bounds ⋮ Game-theoretical approach for task allocation problems with constraints ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Managing blood inventory with multiple independent sources of supply ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ A min-max resource allocation problem with substitutions ⋮ The nonlinear knapsack problem - algorithms and applications

Cites Work

• Unnamed Item
• Unnamed Item
• A Combined Vehicle Routing and Inventory Allocation Problem
• A o(n logn) algorithm for LP knapsacks with GUB constraints
• ALGORITHMS FOR OPTIMAL ALLOCATION PROBLEMS HAVING QUADRATIC OBJECTIVE FUNCTION
• Simple Ranking Methods for Allocation of One Resource
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Productivity of activities in the optimal allocation of one resource
• Exact and Approximate Cost Functions for Product Aggregates
• Technical Note—Allocation of Effort Resources among Competing Activities
• A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
• Implicit representation of generalized variable upper bounds in linear programming
• Data Structures and Computer Science Techniques in Operations Research
• Accelerating List Processing in Discrete Programming
• Technical Note—Comment on an Integer Maximization Problem