Polaroids: A new tool in non‐convex and in integer programming

DOI10.1002/nav.3800200103zbMath0261.90068OpenAlexW2020793627MaRDI QIDQ5677307

C. A. Burdet

Publication date: 1973

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800200103

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Optimization of linear-convex programs, Polyhedral annexation in mixed integer and combinatorial programming, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts

Cites Work

• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Unnamed Item
• Unnamed Item