Using projected cutting planes in the extended cutting plane method
From MaRDI portal
Recommendations
Cites work
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A new mixed integer programming formulation for facility layout design using flexible bays
- A new solution method of ant colony-based logistic center area layout problem
- A nonlinear optimization approach for solving facility layout problems
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Convergence analysis of deflected conditional approximate subgradient methods
- Cyclic subgradient projections
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Reformulations for utilizing separability when solving convex MINLP problems
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- The Cutting-Plane Method for Solving Convex Programs
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The Supporting Hyperplane Method for Unimodal Programming
Cited in
(5)- Cutting planes and column generation techniques with the projective algorithm
- Shallow, deep and very deep cuts in the analytic center cutting plane method.
- Achieving consistency with cutting planes
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Projective cutting-planes
This page was built for publication: Using projected cutting planes in the extended cutting plane method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057972)
