Integer quadratic quasi-polyhedra

DOI10.1007/978-3-642-13036-6_20zbMATH Open1285.90066OpenAlexW1554253101WikidataQ57702206 ScholiaQ57702206MaRDI QIDQ3569823FDOQ3569823

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

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

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)

Cited In (7)

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

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)