An improved linearization technique for a class of quadratic 0-1 programming problems
From MaRDI portal
Publication:691407
DOI10.1007/S11590-010-0249-ZzbMATH Open1259.90068OpenAlexW2070214454MaRDI QIDQ691407FDOQ691407
Authors: Xiaozheng He, Anthony Chen, Wanpracha A. Chaovalitwongse 
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
Recommendations
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- A linearization technique for quadratic integer programming with box constraint
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- An improved linearization strategy for zero-one quadratic programming problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
Cites Work
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An improved linearization strategy for zero-one quadratic programming problems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Decomposition and linearization for 0-1 quadratic programming
- Construction of test problems in quadratic bivalent programming
- A simple recipe for concise mixed 0-1 linearizations
Cited In (14)
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- An improved linearization strategy for zero-one quadratic programming problems
- Mathematical programming models and exact algorithms
- 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
- On the performance of linear programming heuristics applied on a quadratic transformation in the classification problem
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- An efficient linearization technique for mixed 0-1 polynomial problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Computationally attractive nonlinear models for combinatorial optimisation
- On linearization techniques for budget-constrained binary quadratic programming problems
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
This page was built for publication: An improved linearization technique for a class of quadratic 0-1 programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691407)
