The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms (Q4076765) (← links)
- Matroid intersection algorithms (Q4077061) (← links)
- Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102) (← links)
- Facets of the knapsack polytope (Q4077731) (← links)
- Scheduling activities among conflicting facilities to minimize conflict cost (Q4079314) (← links)
- Analysis of mathematical programming problems prior to applying the simplex algorithm (Q4079319) (← links)
- The theorem of the alternative, the key-theorem, and the vector-maximum problem (Q4079322) (← links)
- Improved penalty calculations for a mixed integer branch-and-bound algorithm (Q4079323) (← links)
- An extension of Curry's theorem to steepest descent in normed linear spaces (Q4079330) (← links)
- The travelling salesman problem and a class of polyhedra of diameter two (Q4081007) (← links)
- A central cutting plane algorithm for the convex programming problem (Q4081013) (← links)
- On the core of linear production games (Q4081025) (← links)
- An associated maximization problem for two-person nonzero-sum separable games (Q4082582) (← links)
- The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques (Q4083209) (← links)
- On triangulations for computing fixed points (Q4083225) (← links)
- An efficient algorithm for minimumk-covers in weighted graphs (Q4083700) (← links)
- On “a cofferdam design optimization” (Q4085523) (← links)
- On the foundations of linear and integer linear programming I (Q4086967) (← links)
- A finite algorithm to maximize certain pseudoconcave functions on polytopes (Q4086973) (← links)
- Necessary and sufficient conditions for a penalty method to be exact (Q4090135) (← links)
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches (Q4090137) (← links)
- A note on A complementary variant of Lemke's method (Q4091704) (← links)
- On decision rules in stochastic programming (Q4091720) (← links)
- Convergence bounds for nonlinear programming algorithms (Q4091726) (← links)
- Distribution functions in stochastic programs with recourse: A parametric analysis (Q4093224) (← links)
- A superlinearly convergent algorithm for minimization without evaluating derivatives (Q4093226) (← links)
- A procedure to rank bases by probability of being optimal using imbedded hyperspheres (Q4094652) (← links)
- Optimally conditioned optimization algorithms without line searches (Q4094661) (← links)
- The factorization approach to large-scale linear programming (Q4096702) (← links)
- Global optimization using special ordered sets (Q4096723) (← links)
- Practical convergence conditions for the Davidon-Fletcher-Powell method (Q4097099) (← links)
- An algorithm for the determination of longest distances in a graph (Q4097107) (← links)
- A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem (Q4099434) (← links)
- On using equality-constraint algorithms for inequality constrained problems (Q4103337) (← links)
- Projections in minimax algebra (Q4103344) (← links)
- A fixed point theorem including the last theorem of Poincaré (Q4104582) (← links)
- Integer programming approaches to the travelling salesman problem (Q4105495) (← links)
- An algorithm for nonconvex programming problems (Q4105518) (← links)
- Quadratic duality over convex cone domains (Q4108152) (← links)
- Analytical solution of A dynamic transaction flow problem (Q4109513) (← links)
- On the number of solutions to the linear comple-mentarity problem (Q4110798) (← links)
- Optimal conditioning of self-scaling variable Metric algorithms (Q4110808) (← links)
- Some computationally relevant group theoretic structures of fixed charge problems (Q4114962) (← links)
- On generalizing shapley's index theory to labelled pseudomanifolds (Q4114977) (← links)
- Mathematics in economics: Achievements, difficulties, perspectives (Q4116223) (← links)
- Concepts of optimality and their uses (Q4116251) (← links)
- Explicit duality for convex homogeneous programs (Q4116258) (← links)
- Extremization of functions with equality constraints (Q4116266) (← links)
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class (Q4116268) (← links)
- A unification of the existence theorems of the nonlinear complementarity problem (Q4117579) (← links)
