A Decomposition Method for Quadratic Zero-One Programming
From MaRDI portal
Publication:4859338
Recommendations
- Decomposition and linearization for 0-1 quadratic programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Lagrangean methods for 0-1 quadratic problems
- Bivalent quadratic programming problem - A computational study
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Cited in
(41)- 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
- A global continuation algorithm for solving binary quadratic programming problems
- Linear programming for the \(0-1\) quadratic knapsack problem
- Resolving degeneracy in quadratic programming
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Lagrangean methods for 0-1 quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- An evolutionary heuristic for quadratic 0-1 programming
- Linear and quadratic programming approaches for the general graph partitioning problem
- Parametric Lagrangian dual for the binary quadratic programming problem
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics
- Path relinking for unconstrained binary quadratic programming
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- Building an iterative heuristic solver for a quantum annealer
- An improved linearization strategy for zero-one quadratic programming problems
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- Graph separation techniques for quadratic zero-one programming
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- f-flip strategies for unconstrained binary quadratic programming
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- An algorithm for quadratic zero-one programs
- On the Quadratic Programming Approach for Hub Location Problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- scientific article; zbMATH DE number 724211 (Why is no real title available?)
- A decomposition method for quadratic programming
- Mathematical programming models and exact algorithms
- The bipartite QUBO
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Decomposition and linearization for 0-1 quadratic programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A hybrid metaheuristic approach to solving the UBQP problem
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- ``Miniaturized linearizations for quadratic 0/1 problems
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
This page was built for publication: A Decomposition Method for Quadratic Zero-One Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859338)
