A general algorithm for the optimal distribution of effort

DOI10.1287/MNSC.9.1.50MaRDI QIDQ2778992zbMATH OpenOpenAlexFDO

Authors William Karush

Publication date 22 October 2002

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.9.1.50

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cited in

(11)

• A separable integer programming problem equivalent to its continual version
• On a general network location--production--allocation problem
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• A branch and bound algorithm for solving separable convex integer programming problems
• A survey on the continuous nonlinear resource allocation problem
• On a new functional transform in analysis: The maximum transform
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• On the maximum transform and semigroups of transformations
• Optimal production management model under a restriction for utilizable materials
• Voronoi game on graphs
• Efficient algorithms for robustness in resource allocation and scheduling problems

This page was built for publication: A general algorithm for the optimal distribution of effort

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