Pages that link to "Item:Q3793919"
From MaRDI portal
The following pages link to A Max-Min Allocation Problem: Its Solutions and Applications (Q3793919):
Displaying 33 items.
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- Solving knapsack sharing problems with general tradeoff functions (Q810377) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Multiperiod allocation of substitutable resources (Q1127148) (← links)
- A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726) (← links)
- A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169) (← links)
- Minimax resource allocation problems: Optimization and parametric analysis (Q1198300) (← links)
- Composing batches with yield uncertainty (Q1261341) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- A multi-product loading problem: A model and solution method (Q1278990) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (Q2384607) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Storage space allocation to maximize inter-replenishment times (Q2468476) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Material allocation in MRP with tardiness penalties (Q2564888) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study (Q2883592) (← links)
- Technical Note—On Min-Max Integer Allocation Problems (Q3321840) (← links)
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)
- Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
- (Q4207770) (← links)
- Improved Algorithms for Machine Allocation in Manufacturing Systems (Q4305754) (← links)
- Bottleneck Resource Allocation in Manufacturing (Q4363727) (← links)
- The selection allocation problem (Q4700648) (← links)
- An exact algorithm for large knapsack sharing problems (Q5883603) (← links)
- A minimax resource allocation problem with variable resources (Q5955090) (← links)