Manifold relaxations for integer programming

DOI10.3934/JIMO.2014.10.557MaRDI QIDQ380594zbMATH OpenOpenAlexFDO

Authors Ka Fai Cedric Yiu, Zhiguo Feng

Publication date 14 November 2013

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2014.10.557

zbMATH Keywords

Stiefel manifoldinteger programmingoptimal controlpermutation matrixinteger basis

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Spaces of embeddings and immersions (58D10)

Recommendations

• Solving Lift-and-Project Relaxations of Binary Integer Programs
• A relaxation algorithm for solving mixed integer programming problems
• Alternative group relaxation of integer programming problems
• Recent advances in integer programming
• The integral basis method for integer programming

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• 50 Years of Integer Programming 1958-2008
• A Discrete Filled Function Method for the Design of FIR Filters With Signed-Powers-of-Two Coefficients
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A hybrid descent method for global optimization
• A new hybrid descent method with application to the optimal design of finite precision FIR filters
• An algorithm for nonlinear optimization problems with binary variables
• An exact penalty approach for solving a class of minimization problems with boolean variables
• Branch and bound method for sensor scheduling in discrete time
• Continuous approaches for solving discrete optimization problems
• Discrete filled function method for discrete global optimization
• More test examples for nonlinear programming codes
• Optimal discrete-valued control computation
• Optimal finite-precision approximation of FIR filters
• Penalty formulation for zero-one nonlinear programming
• Penalty parameter for linearly constrained 0--1 quadratic programming
• Solving 0-1 programming problems by a penalty approach.
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• The Geometry of Algorithms with Orthogonality Constraints
• Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)

Cited in

(1)

• Differential optimization in finite-dimensional spaces

This page was built for publication: Manifold relaxations for integer programming

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