The following pages link to Mathematical Programming (Q59162):
Displaying 50 items.
- Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431) (← links)
- Uniform duality in semi-infinite convex optimization (Q3219365) (← links)
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
- Totally balanced games arising from controlled programming problems (Q3221784) (← links)
- A duality theorem for semi-infinite convex programs and their finite subprograms (Q3308653) (← links)
- Optimality conditions for nondifferentiable convex semi-infinite programming (Q3308655) (← links)
- Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization (Q3310490) (← links)
- Economic planning with institutional price constraints for a decentralized economy (Q3313568) (← links)
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- The convergence of variable metric matrices in unconstrained optimization (Q3314451) (← links)
- Local and superlinear convergence for truncated iterated projections methods (Q3314452) (← links)
- An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
- Rational solutions of the graphsack problem (Q3315278) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- Automatic identification of embedded network rows in large-scale optimization models (Q3315283) (← links)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- A unifying model based on retraction for fixed point algorithms (Q3316473) (← links)
- A note on node aggregation and Benders' decomposition (Q3316926) (← links)
- Newton's method for linear complementarity problems (Q3316988) (← links)
- Pseudolinearity and efficiency (Q3318552) (← links)
- On the existence and approximation of zeroes (Q3319694) (← links)
- Sensitivity analysis for the asymmetric network equilibrium problem (Q3320098) (← links)
- Formal optimization of some reduced linear programming problems (Q3320119) (← links)
- Least absolute value and chebychev estimation utilizing least squares results (Q3321322) (← links)
- Computational complexity of a piecewise linear homotopy algorithm (Q3321342) (← links)
- A quadratically convergent method for minimizing a sum of euclidean norms (Q3321365) (← links)
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions (Q3322709) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)
- A note on the computation of an orthonormal basis for the null space of a matrix (Q3326727) (← links)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- Penalty for zero–one integer equivalent problem (Q3328282) (← links)
- Scalarization in vector optimization (Q3328302) (← links)
- Some properties of nondifferentiable pseudoconvex functions (Q3329232) (← links)
- On the core and nucleolus of minimum cost spanning tree games (Q3329250) (← links)
- On the cost of computing roots of polynomials (Q3330394) (← links)
- On the subdifferential of a submodular function (Q3332786) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- Convergence of the cyclical relaxation method for linear inequalities (Q3337217) (← links)
- A weighted gram-schmidt method for convex quadratic programming (Q3337227) (← links)
- A descent algorithm for nonsmooth convex optimization (Q3337229) (← links)
- Structures of polyhedra determined by submodular functions on crossing families (Q3337243) (← links)
- A new linesearch algorithm for nonlinear least squares problems (Q3337958) (← links)
- Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints (Q3337979) (← links)
- Conjugacy in quasi-convex programming (Q3338838) (← links)
- Two kinds of normality in vector optimization (Q3340520) (← links)
- Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis (Q3340644) (← links)
