Book Chapter10.1007/978-1-4613-0303-9_14
Resource Allocation Problems
Naoki Katoh,Toshihide Ibaraki +1 more
- 01 Jan 1998
- pp 905-1006
348
TL;DR: The resource allocation problem seeks to find an optimal allocation of a fixed amount of resources to activities so as to minimize the cost incurred by the allocation.
read more
Abstract: The resource allocation problem seeks to find an optimal allocation of a fixed amount of resources to activities so as to minimize the cost incurred by the allocation. A simplest form of the problem is to minimize a separable convex function under a single constraint concerning the total amount of resources to be allocated. The amount of resources to be allocated to each activity is treated as a continuous or integer variable, depending on the cases. This can be viewed as a special case of the nonlinear programming problem or the nonlinear integer programming problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Design Techniques and Applications of Cyberphysical Systems: A Survey
TL;DR: The aim of this survey is to enable researchers and system designers to get insights into the working and applications of CPSs and motivate them to propose novel solutions for making wide-scale adoption of CPS a tangible reality.
769
Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics
Zne-Jung Lee,Shun-Feng Su,Chou-Yuan Lee +2 more
- 01 Feb 2003
TL;DR: The proposed algorithm is to enhance the performance of GAs by introducing a greedy reformation scheme so as to have locally optimal offspring and has the best performance when compared to other existing search algorithms.
265
The nonlinear knapsack problem – algorithms and applications
Kurt M. Bretthauer,Bala Shetty +1 more
TL;DR: A survey of algorithms and applications for the nonlinear knapsack problem, a nonlinear optimization problem with just one constraint, bounds on the variables, and a set of specially structured constraints such as generalized upper bounds (GUBs), is presented.
264
A survey on the continuous nonlinear resource allocation problem
TL;DR: This paper surveys the history and applications of the problem, as well as algorithmic approaches to its solution, and analyzes the most relevant references, especially regarding their originality and numerical findings.
236
References
•Book
Network Flows: Theory, Algorithms, and Applications
Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin +2 more
- 01 Jan 1993
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
7.6K
•Book
Linear Programming and Extensions
George B. Dantzig
- 01 Jan 1963
TL;DR: This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.
6.1K
Combinatorial optimization:Algorithms and complexity
TL;DR: Eventually, you will unquestionably discover a supplementary experience and achievement by Spending more cash by spending more cash.
5K
•Book
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel,László Lovász,Alexander Schrijver +2 more
- 01 Jan 1988
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
3.9K
Related Papers (5)
Toshihide Ibaraki,Naoki Katoh +1 more
- 25 Mar 1988
Satoru Fujishige
- 01 Jan 1991
Kazuo Murota
- 01 Jan 1987
Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin +2 more
- 01 Jan 1993
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990