A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
From MaRDI portal
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)- An algorithm for the generalized quadratic assignment problem
- A study of the quadratic semi-assignment polytope
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- A mathematical program to refine gene regulatory networks
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- A solvable class of quadratic 0-1 programming
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- A distance assignment approach to the facility layout problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Fractional 0-1 programming: applications and algorithms
- On a linearization technique for solving the quadratic set covering problem and variations
- Minimal arc-sets spanning dicycles
- On linearization techniques for budget-constrained binary quadratic programming problems
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Compact linearization for binary quadratic problems subject to assignment constraints
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- The generalized vertex cover problem and some variations
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- An integer linear programming approach for a class of bilinear integer programs
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Tighter representations for set partitioning problems
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- The linearization problem of a binary quadratic problem and its applications
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Dantzig-Wolfe reformulations for binary quadratic problems
- Structured linear reformulation of binary quadratically constrained quadratic programs
- The quadratic cycle cover problem: special cases and efficient bounds
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- A neurodynamic approach to zero-one quadratic programming
- Valid inequalities for quadratic optimisation with domain constraints
- RLT insights into lift-and-project closures
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Convex hull representations of special monomials of binary variables
- Linear programming insights into solvable cases of the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- An improved linearization strategy for zero-one quadratic programming problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Compact linearization for binary quadratic problems
- Restricted risk measures and robust optimization
- Approximated perspective relaxations: a project and lift approach
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- An algorithm for indefinite integer quadratic programming
- Partial Lagrangian relaxation for general quadratic programming
- Integer programming approaches to the multiple team formation problem
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- A reformulation-linearization technique for optimization over simplices
- A continuous approch for globally solving linearly constrained quadratic
- Mixed integer linear programming formulation techniques
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A mixed integer quadratic programming model for the low autocorrelation binary sequence problem
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- Exact solution of emerging quadratic assignment problems
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Reformulations in Mathematical Programming: Definitions and Systematics
- Linear Reformulations of Integer Quadratic Programs
- On the Quadratic Programming Approach for Hub Location Problems
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Biconvex Models and Algorithms for Risk Management Problems
- A Decomposition Method for Quadratic Zero-One Programming
- scientific article; zbMATH DE number 913269 (Why is no real title available?)
- Lagrangian solution of maximum dispersion problems
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Optimal genetic screening for cystic fibrosis
- Mathematical programming models and exact algorithms
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- Best reduction of the quadratic semi-assignment problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Equity in genetic newborn screening
- Inductive linearization for binary quadratic programs with linear constraints
- Strong SDP based bounds on the cutwidth of a graph
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- The multi-story space assignment problem
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
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)
