Technical Note - On Min-Max Integer Allocation Problems

No abstract is available for this paper.

• Publication year

  1984

• Venue

  Operational Research

• Publication date

  1984-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/opre.32.2.449
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Technical Note - Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

  1981cited by this paper
• On Marginal Allocation in Single Constraint Min-Max Problems

  1971cited by this paper

• Efficient Fuzzy Evolutionary Algorithm-Based Approach for Solving the Student Project Allocation Problem

  2008cites this paper
• A parallel hypercube algorithm for discrete resource allocation problems

  2006cites this paper
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

  2005cites this paper
• A comparative analysis of information acquisition mechanisms for discrete resource allocation

  2001cites this paper
• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach

  1999cites this paper
• Min-Max Optimization of Several Classical Discrete Optimization Problems

  1998cites this paper
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

  1998cites this paper
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications

  1996cites this paper
• On Min-Max Optimization of a Collection of Classical Discrete Optimization Problems

  1995cites this paper
• Solving knapsack sharing problems with general tradeoff functions

  1991cites this paper
• Chapter 6 – ALLOCATION OF RESOURCES IN TREE NETWORKS

  1989cites this paper
• Continuous maximin knapsack problems with GLB constraints

  1986cites this paper