Asignacion de recuerdos max-min: Propiedades y algoritmos

DOI10.1007/BF02888583zbMATH Open0729.90032OpenAlexW1528999055MaRDI QIDQ3354440FDOQ3354440

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

Recommendations

• Publication:4732313
• scientific article; zbMATH DE number 3845343
• scientific article; zbMATH DE number 4197770
• scientific article; zbMATH DE number 3763673
• scientific article; zbMATH DE number 1302182

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

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

Cited In (19)

• 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
• Title not available (Why is that?)
• Adaptive resource allocation to maximize run-out times
• A Max-Min Allocation Problem: Its Solutions and Applications
• Optimal resource allocation with minimum activation levels and fixed costs
• Maximization of the Choquet integral over a convex set and its application to resource allocation problems
• A Min-Max-Sum Resource Allocation Problem and Its Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential resource allocation with constraints: two-customer case
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• Minimum variance allocation among constrained intervals
• Minimax resource allocation problems: Optimization and parametric analysis
• Efficient algorithms for robustness in resource allocation and scheduling problems
• A NOTE ON LUENBERGER'S ZERO-MAXIMUM PRINCIPLE FOR CORE ALLOCATIONS
• Resource optimization and (min,+) spectral theory

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)