A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
From MaRDI portal
Publication:3762072
Recommendations
- An improved linearization strategy for zero-one quadratic programming problems
- Bivalent quadratic programming problem - A computational study
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A continuous approch for globally solving linearly constrained quadratic
Cited in
(only showing first 100 items - show all)- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Pseudo-Boolean optimization
- Selected topics on assignment problems
- Partial Lagrangian relaxation for general quadratic programming
- New formulations of the multiple sequence alignment problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Location coverage models with demand originating from nodes and paths: Application to cellular network design
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Linear programming for the \(0-1\) quadratic knapsack problem
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Two-stage quadratic integer programs with stochastic right-hand sides
- The multi-story space assignment problem
- Extending the QCR method to general mixed-integer programs
- RLT insights into lift-and-project closures
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- An algorithm for indefinite integer quadratic programming
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A continuous approch for globally solving linearly constrained quadratic
- Linear programming insights into solvable cases of the quadratic assignment problem
- Tighter representations for set partitioning problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A survey for the quadratic assignment problem
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- A study of the quadratic semi-assignment polytope
- Fractional 0-1 programming: applications and algorithms
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Exact solution of emerging quadratic assignment problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A mathematical program to refine gene regulatory networks
- Bivalent quadratic programming problem - A computational study
- The quadratic knapsack problem -- a survey
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Integer programming approaches to the multiple team formation problem
- Mathematical programming models and exact algorithms
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- An algorithm for the generalized quadratic assignment problem
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- Designing cost-effective content distribution networks
- Biconvex Models and Algorithms for Risk Management Problems
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- A Decomposition Method for Quadratic Zero-One Programming
- Linear Reformulations of Integer Quadratic Programs
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Mixed integer linear programming formulation techniques
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Lagrangian solution of maximum dispersion problems
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Approximated perspective relaxations: a project and lift approach
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- RLT: A unified approach for discrete and continuous nonconvex optimization
- A solvable class of quadratic 0-1 programming
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- Reformulations in Mathematical Programming: Definitions and Systematics
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- An improved linearization technique for a class of quadratic 0-1 programming problems
- An improved linearization strategy for zero-one quadratic programming problems
- Restricted risk measures and robust optimization
- Best reduction of the quadratic semi-assignment problem
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- The linearization problem of a binary quadratic problem and its applications
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- A neurodynamic approach to zero-one quadratic programming
- Dantzig-Wolfe reformulations for binary quadratic problems
- Valid inequalities for quadratic optimisation with domain constraints
- A mixed integer quadratic programming model for the low autocorrelation binary sequence problem
- Linearization of a 0-1 quadratic fractional programming problem
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Strong SDP based bounds on the cutwidth of a graph
- Convex hull representations of special monomials of binary variables
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- A reformulation-linearization technique for optimization over simplices
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- A distance assignment approach to the facility layout problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Optimal genetic screening for cystic fibrosis
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
This page was built for publication: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762072)
