An improved linearization technique for a class of quadratic 0-1 programming problems
From MaRDI portal
Publication:691407
DOI10.1007/s11590-010-0249-zzbMath1259.90068OpenAlexW2070214454MaRDI QIDQ691407
Anthony Chen, Wanpracha Art Chaovalitwongse, Xiaozheng He
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0249-z
Related Items
Mathematical Programming Models and Exact Algorithms, On linearization techniques for budget-constrained binary quadratic programming problems, A neurodynamic approach to zero-one quadratic programming, Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
Cites Work
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A quadratic integer program for the location of interacting hub facilities
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- A simple recipe for concise mixed 0-1 linearizations
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- An improved linearization strategy for zero-one quadratic programming problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Construction of test problems in quadratic bivalent programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Decomposition and linearization for 0-1 quadratic programming
