The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- An algorithm for linear least squares problems with equality and nonnegativity constraints (Q3911670) (← links)
- Global saddle-point duality for quasi-concave programs (Q3911673) (← links)
- Constrained definite Hessians tend to be well conditioned (Q3911678) (← links)
- On the number of solutions to a class of complementarity problems (Q3911682) (← links)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
- A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
- A new algorithm for the assignment problem (Q3911685) (← links)
- Finding simplicial subdivisions of polytopes (Q3911698) (← links)
- Minimum cost spanning tree games (Q3911709) (← links)
- Comment on a paper by M.C. Cheng (Q3912362) (← links)
- An example of cycling in a feasible point algorithm (Q3912363) (← links)
- One way to solve the parametric quadratic programming problem (Q3912371) (← links)
- An algorithm for computing equilibria in a linear monetary economy (Q3914717) (← links)
- A note about sparsity exploiting quasi-Newton updates (Q3914773) (← links)
- Calculating surrogate constraints (Q3916382) (← links)
- Identification of special structure constraints in linear programs (Q3920989) (← links)
- A global quadratic algorithm for solving a system of mixed equalities and inequalities (Q3920999) (← links)
- On solving a primal geometric program by partial dual optimization (Q3921005) (← links)
- An elementary survey of general duality theory in mathematical programming (Q3921006) (← links)
- A unification of two classes ofQ-matrices (Q3921012) (← links)
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming (Q3922472) (← links)
- Rank of maximum matchings in a graph (Q3922477) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- Optimum matching forests III: Facets of matching forest polyhedra (Q3922480) (← links)
- A smoothing-out technique for min—max optimization (Q3922488) (← links)
- The Braess paradox (Q3922499) (← links)
- Boolean sublattices connected with minimization problems on matroids (Q3922500) (← links)
- Direct theorems in semi-infinite convex programming (Q3923950) (← links)
- Heuristics for the fixed cost median problem (Q3929508) (← links)
- On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533) (← links)
- Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541) (← links)
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542) (← links)
- On minimax optimization problems (Q3929548) (← links)
- On the computational utility of posynomial geometric programming solution methods (Q3929559) (← links)
- A method of centers algorithm for certain minimax problems (Q3929560) (← links)
- The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
- Mixed-integer quadratic programming (Q3931023) (← links)
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities (Q3931030) (← links)
- Decomposition algorithms for locating minimal cuts in a network (Q3931039) (← links)
- On the use of penumbras in blocking and antiblocking theory (Q3931051) (← links)
- Partial pivoting strategies for symmetric gaussian elimination (Q3932580) (← links)
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587) (← links)
- The application of optimal control methodology to nonlinear programming problems (Q3932601) (← links)
- Equilibrium programming:The path following approach and dynamics (Q3932605) (← links)
- A statistical estimate of the structure of multi-extremal problems (Q3932611) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- A discrete Newton algorithm for minimizing a function of many variables (Q3934149) (← links)
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function (Q3934150) (← links)
