A min-max-sum resource allocation problem and its applications

Operations Research

Volumn 49, Issue 6, 2001, Pages 913-922

  Karabati, Selcuk ^a   Kouvelis, Panagiotis ^a   Yu, Gang ^a  

^a KOÇ UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; RESOURCE ALLOCATION;

NONLINEAR INTEGER PROGRAMMING; OPTIMAL OBJECTIVE FUNCTION; ROBUST OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0035521421     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.6.913.10023     Document Type: Article

References (23)

1. Optimization procedure for the analysis of coherent structures
2. The theory of search: Optimal distribution of search effort
3. A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem
4. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
5. Surrogate constraint duality in mathematical programming
6. Surrogate mathematical programs
7. Validation of subgradient optimization
8. The discrete resource allocation problem in flow lines
9. A min-max-sum resource allocation problem and its applications
10. Some relationships between lagrangian and surrogate duality in integer programming
11. Relaxation-based algorithms for minimax optimization problems with resource allocation applications
12. Algorithms for separable nonlinear resource allocation problems
13. A branch and bound algorithm for solving separable convex integer programming problems
14. A nonlinear minimax allocation problem with multiple knapsack constraints
15. On equitable resource allocation problems: A lexico-graphic minimax approach
16. A max-min allocation problem: Its solutions and applications
17. Basic techniques for lot streaming