The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Bottleneck linear programming (Q4117598) (← links)
- Quasi balanced matrices — An addendum (Q4118982) (← links)
- A note on polyhedral sets having A least element (Q4118983) (← links)
- Partial linear characterizations of the asymmetric travelling salesman polytope (Q4119036) (← links)
- Further facet generating procedures for vertex packing polytopes (Q4119038) (← links)
- A set of geometric programming test problems and their solutions (Q4120280) (← links)
- A dual decomposition algorithm (Q4120282) (← links)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313) (← links)
- Some theoretical implications of local optimization (Q4120335) (← links)
- A numerically stable optimization method based on A homogeneous function (Q4121691) (← links)
- Approximate cutting planes in nonlinear programming (Q4121700) (← links)
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints (Q4121703) (← links)
- Feasible directions algorithms for optimization problems with equality and inequality constraints (Q4121704) (← links)
- A network simplex method (Q4123079) (← links)
- Shortest path algorithms for knapsack type problems (Q4123080) (← links)
- Finding the nearest point in A polytope (Q4123085) (← links)
- On A characterization of optimality in convex programming (Q4123086) (← links)
- A method to accelerate the rate of convergence of a class of optimization algorithms (Q4123091) (← links)
- Another note on bimatrix games (Q4123114) (← links)
- Win probabilities and simple majorities in probabilistic voting situations (Q4124543) (← links)
- A cutting plane algorithm for solving bilinear programs (Q4124613) (← links)
- A condensation method for generalized geometric programming (Q4124628) (← links)
- A monotone complementarity problem with feasible solutions but no complementary solutions (Q4124631) (← links)
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming (Q4126077) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- The zero pivot phenomenon in transportation and assignment problems and its computational implications (Q4127627) (← links)
- Linear complementarity problems solvable by A single linear program (Q4127631) (← links)
- Maximization of A convex quadratic function under linear constraints (Q4127644) (← links)
- Hierarchical partition—a new optimal pivoting algorithm (Q4127869) (← links)
- Some convergence properties of the conjugate gradient method (Q4127902) (← links)
- Objective function approximations in mathematical programming (Q4128278) (← links)
- A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
- On triangulations for computing fixed points (Q4132260) (← links)
- A simplicial approximation of a solution for the nonlinear complementarity problem (Q4132271) (← links)
- Generalization of some duality theorems in nonlinear programming (Q4132272) (← links)
- Fractional programming without differentiability (Q4133419) (← links)
- The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming (Q4133427) (← links)
- Sensitivity analysis for nonlinear programming using penalty methods (Q4133431) (← links)
- A generalization of max flow—min cut (Q4133435) (← links)
- Decomposing symmetric exchanges in matroid bases (Q4133653) (← links)
- Compact LP bases for a class of IP problems (Q4135217) (← links)
- An algebraic approach to assignment problems (Q4135225) (← links)
- Testing for complete efficiency in a vector maximization problem (Q4136921) (← links)
- Cost operator algorithms for the transportation problem (Q4136922) (← links)
- Finite horizon approximations of infinite horizon linear programs (Q4136925) (← links)
- On the integer-valued variables in the linear vertex packing problem (Q4136929) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- Simplicial decomposition in nonlinear programming algorithms (Q4136951) (← links)
- Efficiency in multiple objective optimization problems (Q4136958) (← links)
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems (Q4136969) (← links)
