Asignacion de recuerdos max-min: Propiedades y algoritmos

DOI10.1007/BF02888583zbMath0729.90032OpenAlexW1528999055MaRDI QIDQ3354440

A. Marmol Conde, Blas 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) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

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

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