scientific article; zbMATH DE number 3215121
From MaRDI portal
zbMath0132.40103MaRDI QIDQ5342287
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An algorithm for optimizing over the weakly-efficient set, A branch and bound algorithm for extreme point mathematical programming problems, Quadratic functions with exponential number of local maxima, An algebra-based approach for linearly constrained concave minimization, Least trimmed squares regression, least median squares regression, and mathematical program\-ming, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, On the number of local maxima in quadratic 0-1 programs, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Using convex envelopes to solve the interactive fixed-charge linear programming problem, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Nonconvex optimization over a polytope using generalized capacity improvement, Bush optimization method for high ranked stream networks, General purpose heuristics for integer programming. I, Intersection Disjunctions for Reverse Convex Sets, On a class of functions attaining their maximum at the vertices of a polyhedron, Integral global minimization: Algorithms, implementations and numerical tests, Canonical DC programming problem: Outer approximation methods revisited, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Penalty function approach to linear trilevel programming, Convexity cuts for multiple choice problems, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, Linear programs with an additional reverse convex constraint, Convex Maximization via Adjustable Robust Optimization, A general purpose exact solution method for mixed integer concave minimization problems, Reverse convex programming, Outer-product-free sets for polynomial optimization and oracle-based cuts, Cut search methods in integer programming, A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies, On the relation between concavity cuts and the surrogate dual for convex maximization problems, A bilinear programming formulation of the 3-dimensional assignment problem, Integer programming and convex analysis: Intersection cuts from outer polars, On the use of cuts in reverse convex programs, Polaroids: A new tool in non‐convex and in integer programming, Jointly constrained bilinear programs and related problems: An overview, Membership functions, some mathematical programming models and production scheduling, DC programming: overview., A combined cutting-stock and lot-sizing problem, An improved column generation algorithm for minimum sum-of-squares clustering, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Efficient algorithms for solving rank two and rank three bilinear programming problems, New branch-and-Cut algorithm for bilevel linear programming, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Optimality conditions for maximizing a function over a polyhedron, Polyhedral annexation, dualization and dimension reduction technique in global optimization, Construction of the current Steiner network of the second optimality rank, Minimization of a quasi-concave function over an efficient set, A new reformulation-linearization technique for bilinear programming problems, On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions, Variations on a cutting plane method for solving concave minimization problems with linear constraints, The bilinear programming problem, A linear programming approach to solving bilinear programmes, Linear multiplicative programming, A cutting plane algorithm for solving bilinear programs, A cutting plane method for bilevel linear programming with interval coefficients, Maximization of A convex quadratic function under linear constraints, Construction of large-scale global minimum concave quadratic test problems, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Bilinear programming: An exact algorithm, Polyhedral annexation in mixed integer and combinatorial programming, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, On measuring the inefficiency with the inner-product norm in data envelopment analysis, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Separable concave minimization via partial outer approximation and branch and bound, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, Maximization of linearly constrained posynomials, Elements of a theory in non-convex programming, Convex and polaroid extensions, Concave cost minimization on networks, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Generalized \(\gamma\)-valid cut procedure for concave minimization, A level set algorithm for a class of reverse convex programs, Nonlinear programming: Global use of the Lagrangian, A branch and bound-outer approximation algorithm for concave minimization over a convex set, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, A new algorithm to find all vertices of a polytope, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, Global optimization from concave minimization to concave mixed variational inequality, Enhanced intersection cutting-plane approach for linear complementarity problems, On cutting planes for cardinality-constrained linear programs, Convergence of a subgradient method for computing the bound norm of matrices, Parallel computing in nonconvex programming, A penalty function approach for solving bi-level linear programs, Concave minimization via conical partitions and polyhedral outer approximation, Convex programs with an additional reverse convex constraint, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems, Polyhedral convexity cuts and negative edge extensions, A heuristic for the continuous capacity and flow assignment, Depth-optimized convexity cuts
