Asignacion de recuerdos max-min: Propiedades y algoritmos

DOI10.1007/BF02888583MaRDI QIDQ3354440zbMATH OpenOpenAlexFDO

Authors A. Marmol Conde, B. Pelegrín Pelegrín

Publication date 1991

Published in Trabajos de Investigacion Operativa (Search for Journal in Brave)

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

zbMATH Keywords

resource-allocationContinuous and discrete casesminimum trade-off functions

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) 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) Integer programming (90C10) Mixed integer programming (90C11) Existence of solutions for minimax problems (49J35)

Cites work

• scientific article; zbMATH DE number 3807359 (Why is no real title available?)
• A graphical method to solve a family of allocation problems
• A hard knapsack problem
• Algorithms for some minimax problems
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Continuous maximin knapsack problems with GLB constraints
• Exact methods for the knapsack problem and its generalizations
• Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
• The Knapsack Sharing Problem
• The Sharing Problem
• The Theory and Computation of Knapsack Functions

Cited in

(19)

• Resource optimization and (min,+) spectral theory
• Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
• A graphical method to solve a maximin allocation problem
• Continuity and monotonicity of solutions to a greedy maximization problem
• scientific article; zbMATH DE number 37746 (Why is no real title available?)
• Adaptive resource allocation to maximize run-out times
• A Max-Min Allocation Problem: Its Solutions and Applications
• Maximization of the Choquet integral over a convex set and its application to resource allocation problems
• Optimal resource allocation with minimum activation levels and fixed costs
• A Min-Max-Sum Resource Allocation Problem and Its Applications
• scientific article; zbMATH DE number 3763673 (Why is no real title available?)
• scientific article; zbMATH DE number 4118180 (Why is no real title available?)
• scientific article; zbMATH DE number 3845343 (Why is no real title available?)
• Sequential resource allocation with constraints: two-customer case
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• Minimax resource allocation problems: Optimization and parametric analysis
• Minimum variance allocation among constrained intervals
• Efficient algorithms for robustness in resource allocation and scheduling problems
• A NOTE ON LUENBERGER'S ZERO-MAXIMUM PRINCIPLE FOR CORE ALLOCATIONS

This page was built for publication: Asignacion de recuerdos max-min: Propiedades y algoritmos

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