The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- An analysis of the solution set to a homotopy equation between polynomials with real coefficients (Q3341775) (← links)
- Integral approximation sequences (Q3343105) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- A note on limiting infisup theorems (Q3344750) (← links)
- Quadratic geometric programming with application to machining economics (Q3347641) (← links)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800) (← links)
- Maximal flow through a domain (Q3659497) (← links)
- The continuous collapsing Knapsack problem (Q3659529) (← links)
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods (Q3659547) (← links)
- The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
- An improved disaggregation method for transportation problems (Q3662998) (← links)
- Maximum-throughput dynamic network flows (Q3664790) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Computational aspects of two-segment separable programming (Q3664835) (← links)
- Error bounds for the aggregated convex programming problem (Q3664837) (← links)
- Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) (← links)
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems (Q3664843) (← links)
- On the uniqueness of solutions to linear complementarity problems (Q3664848) (← links)
- On cycling in the network simplex method (Q3664851) (← links)
- An ideal column algorithm for integer programs with special ordered sets of variables (Q3666590) (← links)
- Computation of all solutions to a system of polynomial equations (Q3666603) (← links)
- QN-like variable storage conjugate gradients (Q3668748) (← links)
- Marginal values and second-order necessary conditions for optimality (Q3669192) (← links)
- Computational experience with advanced implementation of decomposition algorithms for linear programming (Q3670456) (← links)
- Distributed asynchronous computation of fixed points (Q3671771) (← links)
- Decomposition through formalization in a product space (Q3673556) (← links)
- Aggregation bounds in stochastic linear programming (Q3675909) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
- Metrics and undirected cuts (Q3680585) (← links)
- Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)
- Applications of the method of partial inverses to convex programming: Decomposition (Q3680618) (← links)
- An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations (Q3680620) (← links)
- A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254) (← links)
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming (Q3682264) (← links)
- An alternative variational principle for variable metric updating (Q3683080) (← links)
- A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
- On polyhedral extension of some LP theorems (Q3683895) (← links)
- Variable metric relaxation methods, part II: The ellipsoid method (Q3683896) (← links)
- Simple bounds for solutions of monotone complementarity problems and convex programs (Q3683929) (← links)
- Sequential location-allocation problems on chains and trees with probabilistic link demands (Q3686391) (← links)
- On the global convergence of trust region algorithms for unconstrained minimization (Q3686437) (← links)
- On stationary equilibria of a single-controller stochastic game (Q3686594) (← links)
- On market prices in linear production games (Q3688051) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- Ratios of affine functions (Q3688109) (← links)
- Supports and convex envelopes (Q3688113) (← links)
- The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic (Q3688114) (← links)
- Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120) (← links)
