Discrete effort distribution via regret-enabled greedy algorithm

DOI10.1007/978-981-95-0215-8_9MaRDI QIDQ6867286zbMATH OpenFDO

Authors Song Cao, Taikun Zhu, Kai Jin

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0215-8_9

zbMATH Keywords

+)\) convolution\((\maxdiscrete effort distributionheapsregret-enabled greedy algorithmresource allocation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• An effective genetic algorithm approach to multiobjective resource allocation problems (MORAPs)
• Clustered Integer 3SUM via Additive Combinatorics
• Discrete convex analysis
• Discrete Optimization Via Marginal Analysis
• Fast algorithms for the maximum convolution problem
• Faster 0-1-knapsack via near-convex min-plus-convolution
• Faster min-plus product for monotone instances
• scientific article; zbMATH DE number 1384868 (Why is no real title available?)
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Minimization of an M-convex function
• Necklaces, Convolutions, and X + Y
• Nonlinear integer programming for optimal allocation in stratified sampling
• On problems equivalent to \((\min,+)\)-convolution
• Targeting problems in manufacturing queueing networks -- an iterative scheme and convergence
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• The Nonlinear Resource Allocation Problem
• Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks

This page was built for publication: Discrete effort distribution via regret-enabled greedy algorithm

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