The following pages link to (Q4286721):
Displaying 50 items.
- A decentralized heuristic approach towards resource allocation in femtocell networks (Q280437) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Decentral allocation planning in multi-stage customer hierarchies (Q319792) (← links)
- An ASIP model with general gate opening intervals (Q333450) (← links)
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems (Q340685) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- Optimal response against bioterror attack on airport terminal (Q439698) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Approximation based fuzzy multi-objective models with expected objectives and chance constraints: application to earth-rock work allocation (Q497129) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem (Q627082) (← links)
- Mission-based component testing for series systems (Q646630) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
- Generalized surrogate problem methodology for online stochastic discrete optimization (Q700765) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- Decomposition of uniform resource allocation problems (Q795743) (← links)
- Dynamic pricing and the direct-to-customer model in the automotive industry (Q816732) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- An inspection game with multiple inspectees (Q859702) (← links)
- A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
- Resource planning and allocation problem under uncertain environment (Q905152) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- The design of optimum component test plans for system reliability (Q959396) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- Algorithms for storage allocation based on client preferences (Q975763) (← links)
- Selecting the nozzle assortment for a gantry-type placement machine (Q991818) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Some methods for evaluating the optimality of elements in matroids with ill-known weights (Q1037947) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- Multiperiod allocation of substitutable resources (Q1127148) (← links)
- A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169) (← links)
- Minimax resource allocation problems: Optimization and parametric analysis (Q1198300) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints (Q1266739) (← links)
- Identifying Pareto-optimal settlements for two-party resource allocation negotiations (Q1268139) (← links)
- Project selection with discounted returns and multiple constraints (Q1278274) (← links)
- Effect of modeling uncertainty on some routing problems (Q1293962) (← links)
- Generating the best \(K\) sequences in relocation problems (Q1309945) (← links)
- Optimization of static traffic allocation policies (Q1318712) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
