scientific article; zbMATH DE number 3215121
From MaRDI portal
Publication:5342287
Cited in
(only showing first 100 items - show all)- Convergence of a subgradient method for computing the bound norm of matrices
- Convex programs with an additional reverse convex constraint
- 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
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes
- 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
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Membership functions, some mathematical programming models and production scheduling
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- A new reformulation-linearization technique for bilinear programming problems
- A linear programming approach to solving bilinear programmes
- Linear multiplicative programming
- Maximization of linearly constrained posynomials
- Concave cost minimization on networks
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Parallel computing in nonconvex programming
- A penalty function approach for solving bi-level linear programs
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- General purpose heuristics for integer programming. I
- Penalty function approach to linear trilevel programming
- Convexity cuts for multiple choice problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Generalized \(\gamma\)-valid cut procedure for concave minimization
- A heuristic for the continuous capacity and flow assignment
- An algebra-based approach for linearly constrained concave minimization
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming
- Nonconvex optimization over a polytope using generalized capacity improvement
- Integral global minimization: Algorithms, implementations and numerical tests
- Canonical DC programming problem: Outer approximation methods revisited
- DC programming: overview.
- A combined cutting-stock and lot-sizing problem
- Construction of the current Steiner network of the second optimality rank
- A convergent conical algorithm with -bisection for concave minimization
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Optimality conditions for maximizing a function over a polyhedron
- A cutting plane method for bilevel linear programming with interval coefficients
- Construction of large-scale global minimum concave quadratic test problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Separable concave minimization via partial outer approximation and branch and bound
- A new algorithm to find all vertices of a polytope
- On cutting planes for cardinality-constrained linear programs
- On the number of local maxima in quadratic 0-1 programs
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- New branch-and-Cut algorithm for bilevel linear programming
- Nonlinear programming: Global use of the Lagrangian
- Enhanced intersection cutting-plane approach for linear complementarity problems
- A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
- A generalization of -subdivision ensuring convergence of the simplicial algorithm
- Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
- A bilinear programming formulation of the 3-dimensional assignment problem
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- 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
- Elements of a theory in non-convex programming
- Convex and polaroid extensions
- A convergent simplicial algorithm with -subdivision and -bisection strategies
- On the relation between concavity cuts and the surrogate dual for convex maximization problems
- Polyhedral convexity cuts and negative edge extensions
- Bush optimization method for high ranked stream networks
- Intersection Disjunctions for Reverse Convex Sets
- Convex Maximization via Adjustable Robust Optimization
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Cut search methods in integer programming
- Integer programming and convex analysis: Intersection cuts from outer polars
- Polaroids: A new tool in non‐convex and in integer programming
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- On measuring the inefficiency with the inner-product norm in data envelopment analysis
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- A general purpose exact solution method for mixed integer concave minimization problems
- Best-effort adaptation
- A dual method for polar cuts in disjoint bilinear programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- Non-convex optimization problems with linear KKT subsystem
- Minimization of a quasi-concave function over an efficient set
- Globally solving concave quadratic programs via doubly nonnegative relaxation
- Reliable pathfinding problems for a correlated network: a linear programming problem in a hypergraph
- Submodular maximization and its generalization through an intersection cut lens
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
- A level set algorithm for a class of reverse convex programs
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Global optimization from concave minimization to concave mixed variational inequality
- Concave minimization via conical partitions and polyhedral outer approximation
- Depth-optimized convexity cuts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342287)
