Pages that link to "Item:Q2456404"
From MaRDI portal
The following pages link to A survey on the continuous nonlinear resource allocation problem (Q2456404):
Displaying 50 items.
- A method of bi-coordinate variations with tolerances and its convergence (Q268944) (← links)
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← 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)
- Importance of verifying queue model assumptions before planning with simulation software (Q439533) (← links)
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- Multiobjective optimization of credit capital allocation in financial institutions (Q519000) (← links)
- A model predictive control approach to the periodic implementation of the solutions of the optimal dynamic resource allocation problem (Q627082) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Resource planning and allocation problem under uncertain environment (Q905152) (← links)
- Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Probabilistic solutions for a class of deterministic optimal allocation problems (Q1696457) (← links)
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming (Q1716951) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
- Stochastic optimization for real time service capacity allocation under random service demand (Q1931638) (← links)
- A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem (Q1997319) (← links)
- Resource allocation problems in decentralized energy management (Q2014593) (← links)
- On the optimal design of the randomized unbiased Monte Carlo estimators (Q2060580) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- Solving nested-constraint resource allocation problems with an interior point method (Q2183209) (← links)
- Minimizing a stochastic convex function subject to stochastic constraints and some applications (Q2229571) (← links)
- Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
- A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems (Q2333721) (← links)
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- A library for continuous convex separable quadratic knapsack problems (Q2355800) (← links)
- Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
- Multi-period resource allocation for estimating project costs in competitive bidding (Q2401316) (← links)
- Selective bi-coordinate method for limit non-smooth resource allocation type problems (Q2416621) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- Fast algorithm for the quadratic knapsack problem (Q2674729) (← links)
- Signalling and obfuscation for congestion control (Q2799244) (← links)
- A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
- A sequential updating scheme of the Lagrange multiplier for separable convex programming (Q2826683) (← links)
- <i>r</i>-extreme signalling for congestion control (Q2979529) (← links)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables (Q3008595) (← links)
- Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- The Nonlinear Resource Allocation Problem (Q4897079) (← links)
- A Coordinate Wise Variational Method with Tolerance Functions (Q4957493) (← links)
