Simple Ranking Methods for Allocation of One Resource
From MaRDI portal
Cited in
(45)- Solving knapsack problems with \(S\)-curve return functions
- A graphical method to solve a maximin allocation problem
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- A graphical bicriteria approach to the resource allocation problem
- Composing batches with yield uncertainty
- Simple solution procedures for nonlinear programming problems that are derivative decomposable
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- Resource allocation among competing activities: A lexicographic minimax approach
- Solution techniques for some allocation problems
- A min-max resource allocation problem with substitutions
- Managing blood inventory with multiple independent sources of supply
- The newsvendor problem with capacitated suppliers and quantity discounts
- Stochastic linear knapsack programming problem and its application to a portfolio selection problem
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Max-min resource allocation
- On the robustness of mixture index of fit
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Determination of reorder points for spare parts in a two-echelon inventory system: The case of non identical maintenance facilities
- Inverse optimization for linearly constrained convex separable programming problems
- Assessing reliability of modular software
- Dynamic optimal budget allocation for integrated marketing considering persistence
- A breakpoint search approach for convex resource allocation problems with bounded variables
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait
- Convex programming with single separable constraint and bounded variables
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- A survey on the continuous nonlinear resource allocation problem
- The nonlinear knapsack problem - algorithms and applications
- Stochastic allocation of a resource among partially interchangeable activities
- Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
- A faster algorithm for the resource allocation problem with convex cost functions
- Competitive Resource Allocation Among Urban Congestion Areas in a Modern Big City
- Discrete resource allocation with tree constraints by an incremental method
- Application of sphere packing theory in financial management
- Single-period stochastic demand fulfillment in customer hierarchies
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Cyclic service queues with very short service times
- Polymatroidal flow network models with multiple sinks
- Order transmission efficiency optimization in hierarchical organizations
- A heuristic algorithm for a chance constrained stochastic program
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Log-concavity of compound distributions with applications in operational and actuarial models
- Decision model and analysis for investment interest expense deduction and allocation
- A nonlinear minimax allocation problem with multiple knapsack constraints
This page was built for publication: Simple Ranking Methods for Allocation of One Resource
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895236)
