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)- On the Quadratic Programming Approach for Hub Location Problems
- Linear programming for the \(0-1\) quadratic knapsack problem
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- A distance assignment approach to the facility layout problem
- A reformulation-linearization technique for optimization over simplices
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Lagrangian solution of maximum dispersion problems
- The quadratic cycle cover problem: special cases and efficient bounds
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Bivalent quadratic programming problem - A computational study
- Inductive linearization for binary quadratic programs with linear constraints
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- A mixed integer quadratic programming model for the low autocorrelation binary sequence problem
- Tighter representations for set partitioning problems
- Minimal arc-sets spanning dicycles
- On linearization techniques for budget-constrained binary quadratic programming problems
- The quadratic knapsack problem
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- Exact hybrid approach to the wind farm layout optimisation problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- A revised reformulation-linearization technique for the quadratic assignment problem
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Submodular maximization and its generalization through an intersection cut lens
- RLT insights into lift-and-project closures
- 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
- Optimal genetic screening for cystic fibrosis
- Restricted risk measures and robust optimization
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Approximated perspective relaxations: a project and lift approach
- RLT: A unified approach for discrete and continuous nonconvex optimization
- An improved linearization strategy for zero-one quadratic programming problems
- A Decomposition Method for Quadratic Zero-One Programming
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- Linear Reformulations of Integer Quadratic Programs
- Valid inequalities for quadratic optimisation with domain constraints
- Mathematical programming models and exact algorithms
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Partial Lagrangian relaxation for general quadratic programming
- The linearization problem of a binary quadratic problem and its applications
- Constrained 0-1 quadratic programming: basic approaches and extensions
- The quadratic knapsack problem with setup
- Pseudo-Boolean optimization
- Selected topics on assignment problems
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Enabling research through the SCIP Optimization Suite 8.0
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
- Integer programming approaches to the multiple team formation problem
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Dantzig-Wolfe reformulations for binary quadratic problems
- A neurodynamic approach to zero-one quadratic programming
- An algorithm for indefinite integer quadratic programming
- Fractional 0-1 programming: applications and algorithms
- Best reduction of the quadratic semi-assignment problem
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Two-stage quadratic integer programs with stochastic right-hand sides
- Linear programming insights into solvable cases of the quadratic assignment problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Linearization of a 0-1 quadratic fractional programming problem
- A survey for the quadratic assignment problem
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- The generalized vertex cover problem and some variations
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- Efficient separation of RLT cuts for implicit and explicit bilinear terms
- Reformulations in Mathematical Programming: Definitions and Systematics
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- A continuous approch for globally solving linearly constrained quadratic
- The multi-story space assignment problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Extending the QCR method to general mixed-integer programs
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Strong SDP based bounds on the cutwidth of a graph
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- 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
- 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
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)
