An efficient algorithm for the parametric resource allocation problem

DOI10.1016/0166-218X(85)90048-4zbMath0564.90080OpenAlexW2005718032MaRDI QIDQ1058467

Naoki Katoh, Toshihide Ibaraki

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90048-4

zbMATH Keywords

algorithmparametric resource allocationsequence of all optimal solutionssum of separable single-variable convex functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic spanning tree problem
• Maintenance of configurations in the plane
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Computational complexity of parametric linear programming
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
• Discrete Optimization Via Marginal Analysis

This page was built for publication: An efficient algorithm for the parametric resource allocation problem