On-line and off-line vertex enumeration by adjacency lists
From MaRDI portal
Publication:1180822
DOI10.1016/0167-6377(91)90042-NzbMath0774.90055OpenAlexW1973767752MaRDI QIDQ1180822
Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard
Publication date: 27 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90042-n
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Constraint decomposition algorithms in global optimization, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Efficient algorithms for solving nonlinear fractional programming problems, Decomposition approach for the global minimization of biconcave functions over polytopes, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Canonical DC programming problem: Outer approximation methods revisited, Piece adding technique for convex maximization problems, A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming, A new duality approach to solving concave vector maximization problems, Errors bounds for finite approximations of coherent lower previsions on finite probability spaces, DC programming: overview., A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, A convex analysis approach for convex multiplicative programming, A new simplicial cover technique in constrained global optimization, Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization, Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning, An outer approximation method for minimizing the product of several convex functions on a convex set, An objective space cut and bound algorithm for convex multiplicative programmes, Bisecton by global optimization revisited, An approximation algorithm for convex multi-objective programming problems, Unnamed Item, An exact solution method for reliability optimization in complex systems, Inverse eigenvalue problems for linear complementarity systems, Conical partition algorithm for maximizing the sum of dc ratios, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Approximating the nondominated set of an MOLP by approximately solving its dual problem, Difference of convex solution of quadratically constrained optimization problems., Solving generalized convex multiobjective programming problems by a normal direction method, MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS
Cites Work
- Unnamed Item
- Unnamed Item
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- A new algorithm to find all vertices of a polytope
- The Complexity of Vertex Enumeration Methods
- Global optimization under Lipschitzian constraints
- Concave Minimization Via Collapsing Polytopes
- A method for globally minimizing concave functions over convex sets
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A Successive Underestimation Method for Concave Minimization Problems
