The following pages link to (Q4101610):
Displaying 50 items.
- Best Lipschitz constants of solutions of quadratic programs (Q328443) (← links)
- Bottleneck capacitated transportation problem with bounds on rim conditions (Q505193) (← links)
- On the expected value of stochastic linear programs and (dynamic) network flow problems (Q579134) (← links)
- A class of chance constrained network optimization problems (Q753659) (← links)
- Some properties of \(Q\)-matrices (Q789477) (← links)
- On trade-off solution pairs in a special type of transportation problem (Q792881) (← links)
- A feasible directions method for computing Bayes E-optimal block designs (Q804197) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- A Markovian queueing transportation network problem (Q919981) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- A simple inversion method for determining aerosol size distributions (Q1050754) (← links)
- Polyhedral functions and multiparametric linear programming (Q1078087) (← links)
- A parametric approach to complementarity theory (Q1079132) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- NP-completeness of the linear complementarity problem (Q1095806) (← links)
- An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872) (← links)
- Structure properties of W matrices (Q1112145) (← links)
- Integer linear programming formulation of the material requirements planning problem (Q1142149) (← links)
- Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785) (← links)
- Nonlinear one-parametric minimal cost network flow problems (Q1168209) (← links)
- Cores of partitioning games (Q1168899) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- A distance assignment approach to the facility layout problem (Q1197697) (← links)
- Generalized isotone optimization with applications to starshaped functions (Q1250678) (← links)
- Long-run behavior of constrained discrete-time linear dynamical systems (Q1257439) (← links)
- More tight monomials in quantized enveloping algebras (Q1270976) (← links)
- Sensitivity analysis based objective coordination of constrained multi-objective multi-degree-of-freedom optimization (Q1286646) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Bandwidth allocation in ATM networks (Q1319822) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- A restricted-entry method for a transportation problem with piecewise- linear concave costs (Q1332825) (← links)
- Stochastic allocation of a resource among partially interchangeable activities (Q1333555) (← links)
- An interactive decision procedure with multiple attributes under risk (Q1339172) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Piecewise linear programming via interior points (Q1582686) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- Scheduling of power generation via large-scale nonlinear optimization (Q1821695) (← links)
- Maximizing pseudoconvex transportation problem: A special type (Q1891876) (← links)
- Scatter search and star-paths: Beyond the genetic metaphor (Q1908997) (← links)
- On ranking of feasible solutions of a bottleneck linear programming problem (Q1919119) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- An investigation of feasible descent algorithms for estimating the condition number of a matrix (Q1939108) (← links)
- A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
- Abstract tropical linear programming (Q2188843) (← links)
- A range-space implementation for large quadratic programs with small active sets (Q2277143) (← links)
- Stability of the optimal basis of a linear program under uncertainty (Q2367033) (← links)
- Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
