Manifold relaxations for integer programming
From MaRDI portal
Publication:380594
DOI10.3934/jimo.2014.10.557zbMath1281.90025OpenAlexW2324858538MaRDI QIDQ380594
Ka-Fai Cedric Yiu, Zhi Guo 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Spaces of embeddings and immersions (58D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for nonlinear optimization problems with binary variables
- Penalty formulation for zero-one nonlinear programming
- More test examples for nonlinear programming codes
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Penalty parameter for linearly constrained 0--1 quadratic programming
- A hybrid descent method for global optimization
- Optimal finite-precision approximation of FIR filters
- Optimal discrete-valued control computation
- Solving 0-1 programming problems by a penalty approach.
- Discrete filled function method for discrete global optimization
- Branch and bound method for sensor scheduling in discrete time
- Verifying the Goldbach conjecture up to 4⋅10¹⁴
- A new hybrid descent method with application to the optimal design of finite precision FIR filters
- 50 Years of Integer Programming 1958-2008
- An exact penalty approach for solving a class of minimization problems with boolean variables
- The Geometry of Algorithms with Orthogonality Constraints
- A Discrete Filled Function Method for the Design of FIR Filters With Signed-Powers-of-Two Coefficients
This page was built for publication: Manifold relaxations for integer programming
