Pages that link to "Item:Q1198300"

The following pages link to Minimax resource allocation problems: Optimization and parametric analysis (Q1198300):

Displaying 18 items.

• Approximation based fuzzy multi-objective models with expected objectives and chance constraints: application to earth-rock work allocation (Q497129) (← links)
• An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← 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)
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
• Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
• Continuity and monotonicity of solutions to a greedy maximization problem (Q2216174) (← links)
• Allocating multiple defensive resources in a zero-sum game setting (Q2348762) (← 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)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
• An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)
• A minimax resource allocation problem with variable resources (Q5955090) (← links)