Integer quadratic quasi-polyhedra

DOI10.1007/978-3-642-13036-6_20MaRDI QIDQ3569823zbMATH OpenOpenAlexWikidataFDO

Authors Adam N. Letchford

Publication date 22 June 2010

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13036-6_20

zbMATH Keywords

convex analysispolyhedral combinatoricsmixed-integer non-linear programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11)

Recommendations

• Unbounded convex sets for non-convex mixed-integer quadratic programming
• Integer quadratic programming in the plane
• Polyhedra related to integer-convex polynomial systems
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• scientific article; zbMATH DE number 3970529

Cited in

(7)

• Valid inequalities for quadratic optimisation with domain constraints
• Gap inequalities for non-convex mixed-integer quadratic programs
• On the separation of split inequalities for non-convex quadratic integer programming
• Arithmetic Discrete Planes Are Quasicrystals
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• On the facet defining inequalities of the mixed-integer bilinear covering set
• Unbounded convex sets for non-convex mixed-integer quadratic programming

This page was built for publication: Integer quadratic quasi-polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569823)