Solution techniques for some allocation problems

DOI10.1007/BF02591716MaRDI QIDQ3955156zbMATH OpenFDO

Authors Awi Federgruen, Paul Zipkin

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02591716

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)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
• 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
• Accelerating List Processing in Discrete Programming
• Data Structures and Computer Science Techniques in Operations Research
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Exact and Approximate Cost Functions for Product Aggregates
• Implicit representation of generalized variable upper bounds in linear programming
• Productivity of activities in the optimal allocation of one resource
• Simple Ranking Methods for Allocation of One Resource
• Technical Note—Allocation of Effort Resources among Competing Activities
• Technical Note—Comment on an Integer Maximization Problem

Cited in

(13)

• Resource allocation among competing activities: A lexicographic minimax approach
• Ant colony optimization for the nonlinear resource allocation problem
• A min-max resource allocation problem with substitutions
• Managing blood inventory with multiple independent sources of supply
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• 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
• A survey on the continuous nonlinear resource allocation problem
• The nonlinear knapsack problem - algorithms and applications
• Quadratic resource allocation with generalized upper bounds
• Game-theoretical approach for task allocation problems with constraints
• Efficient algorithms for robustness in resource allocation and scheduling problems

This page was built for publication: Solution techniques for some allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955156)