Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
From MaRDI portal
Publication:2386196
DOI10.1016/j.disopt.2004.03.006zbMath1091.90040OpenAlexW2135187522WikidataQ60395652 ScholiaQ60395652MaRDI QIDQ2386196
Warren P. Adams, Richard J. Forrester, Fred Glover
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.006
Related Items
Dantzig-Wolfe reformulations for binary quadratic problems, Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs, Mathematical Programming Models and Exact Algorithms, SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression, A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX, A computational study for bilevel quadratic programs using semidefinite relaxations, The quadratic cycle cover problem: special cases and efficient bounds, Fractional 0-1 programming: applications and algorithms, Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme, Two-stage quadratic integer programs with stochastic right-hand sides, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Linear forms of nonlinear expressions: new insights on old ideas, Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, An enhanced logarithmic method for signomial programming with discrete variables, An improved linearization technique for a class of quadratic 0-1 programming problems, RLT insights into lift-and-project closures, Measuring diversity. A review and an empirical analysis, Theoretical and computational study of several linearisation techniques for binary quadratic problems, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, Tightening concise linear reformulations of 0-1 cubic programs, Lagrangean decompositions for the unconstrained binary quadratic programming problem, On the Quadratic Programming Approach for Hub Location Problems, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, A linearization framework for unconstrained quadratic (0-1) problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners, A revised reformulation-linearization technique for the quadratic assignment problem, A conditional logic approach for strengthening mixed 0-1 linear programs
Uses Software
Cites Work
- Mixed-integer bilinear programming problems
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- A simple recipe for concise mixed 0-1 linearizations
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Exact Solution of the Quadratic Knapsack Problem
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
