Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities

DOI10.1287/OPRE.38.5.902MaRDI QIDQ5202037zbMATH OpenOpenAlexFDO

Authors L. K. Platzman, Steven T. Hackman

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.38.5.902

zbMATH Keywords

near-optimal solutionnondifferentiable additively-separable non-concave objective functionnonsmooth convex relation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Algorithms for separable nonlinear resource allocation problems
• scientific article; zbMATH DE number 1302182
• Methods and algorithms for solving the resource allocation problem
• Solving a family of simple allocation problems.
• Resource allocation with wobbly functions

Cited in

(17)

• Order picking with heterogeneous technologies: an integrated article-to-device assignment and manpower allocation problem
• Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
• Enhancing performance in order picking processes by dynamic storage systems
• A metastrategy for large-scale resource management based on informational decomposition
• On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
• A constraint-programming approach for the storage space allocation problem in a distribution center
• Scheduling the replenishment of just-in-time supermarkets in assembly plants
• REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity
• Design and control of warehouse order picking: a literature review
• Mathematical model for warehouse design and product allocation
• Efficient resource allocation with non-concave objective functions
• Solving a family of simple allocation problems.
• Optimal spares allocation to an exchangeable-item repair system with tolerable wait
• Forward-reserve allocation in a warehouse with unit-load replenishments
• The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
• scientific article; zbMATH DE number 6026890 (Why is no real title available?)
• Decision model and analysis for investment interest expense deduction and allocation

This page was built for publication: Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities

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