On cutting plane algorithms for nonlinear binary optimization
From MaRDI portal
Cites work
- A branch and bound algorithm for the maximum diversity problem
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- A geometrical insight on pseudoconvexity and pseudomonotonicity
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A review on discrete diversity and dispersion maximization from an OR perspective
- An exact cutting plane method for the Euclidean max-sum diversity problem
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Branching and bounds tighteningtechniques for non-convex MINLP
- Characterizations of nonsmooth robustly quasiconvex functions
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- Eigenvalues of euclidean distance matrices
- Finding efficient solutions by free disposal outer approximation
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 1033392 (Why is no real title available?)
- scientific article; zbMATH DE number 824554 (Why is no real title available?)
- Links between sums over paths in Bernoulli's triangles and the Fibonacci numbers
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
- On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space.
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- On the Pseudoconvexity of a Quadratic Fractional Function
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Optimization and the Geometry of Numbers: Packing and Covering
- Polyhedral approximation in mixed-integer convex optimization
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Positive symmetric matrices with exactly one positive eigenvalue
- Rank-one modification of the symmetric eigenproblem
- Remarks to Maurice Fréchet's article ``Sur la définition axiomatique d'une classe d'espaces vectoriels distanciés applicables vectoriellement sur l'espace de Hilbert.
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Solving Euclidean max-sum problems exactly with cutting planes
- Some equivalent results with Yakubovich's S-Lemma
- Sphere packings. (Edited by John Talbot)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The Many Proofs and Applications of Perron's Theorem
- The supporting hyperplane optimization toolkit for convex MINLP
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Using regularization and second order information in outer approximation for convex MINLP
This page was built for publication: On cutting plane algorithms for nonlinear binary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962923)
