The following pages link to (Q4039868):
Displayed 50 items.
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Incremental constraint deletion in systems of linear constraints (Q672413) (← links)
- Constructive characterization of Lipschitzian \(Q_ 0\)-matrices (Q676035) (← links)
- On a global projection-type error bound for the linear complementarity problem (Q677141) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- A note on solvability of a class of linear complementarity problems (Q689125) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games (Q700098) (← links)
- On the modulus algorithm for the linear complementarity problem. (Q703242) (← links)
- A new subclass of \(P\)-matrices (Q703643) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Linear time algorithms for convex and monotone approximation (Q792060) (← links)
- Efficient models for the facility layout problem (Q803026) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems (Q810375) (← links)
- Optimality criteria for general unconstrained geometric programming problems (Q811403) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- A smoothing Broyden-like method for the mixed complementarity problems (Q814293) (← links)
- A dual-based algorithm for solving lexicographic multiple objective programs (Q853009) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- On critical capacity of arcs in a directed network (Q856164) (← links)
- A modified damped Newton method for linear complementarity problems (Q857647) (← links)
- A simplex algorithm for piecewise-linear fractional programming problems (Q859908) (← links)
- On computer-assisted proofs for solutions of linear complementarity problems (Q861881) (← links)
- Breast cancer prediction using the isotonic separation technique (Q877069) (← links)
- A new \(O(n^ 2)\) shortest chain algorithm (Q911302) (← links)
- Perturbation results for the linear complementarity problem (Q917452) (← links)
- Good hidden \(P\)-matrix sandwiches (Q996290) (← links)
- Worst case analysis of resistive networks using linear programming approach (Q1052993) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- Minimax linear programming problem (Q1075944) (← links)
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices (Q1081665) (← links)
- On the solution of linear programming problems with free (unrestricted) variables (Q1086153) (← links)
- The linear complementarity problem and a subclass of fully semimonotone matrices (Q1087473) (← links)
- Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911) (← links)
- A new simple homotopy algorithm for linear programming. I (Q1102185) (← links)
- Two characterization theorems in complementarity theory (Q1102208) (← links)
- Computing complex chemical equilibria by generalized linear programming (Q1117837) (← links)
- The k most vital arcs in the shortest path problem (Q1119183) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491) (← links)
- A time minimising transportation problem with quantity dependent time (Q1150308) (← links)
- The set of limiting distributions for a Markov chain with fuzzy transition probabilities (Q1156428) (← links)
- On the bottleneck linear programming problem (Q1161448) (← links)
- A preview of a tolerance approach to sensitivity analysis in linear programming (Q1171506) (← links)