A Decomposition Method for Quadratic Zero-One Programming
From MaRDI portal
Publication:4859338
DOI10.1287/mnsc.41.4.704zbMath0836.90121OpenAlexW2126662731MaRDI QIDQ4859338
Alain Sutter, Pierre Chardaire
Publication date: 7 January 1996
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.41.4.704
Related Items (34)
A Lagrangean decomposition for the maximum independent set problem applied to map labeling ⋮ \(f\)-flip strategies for unconstrained binary quadratic programming ⋮ Mathematical Programming Models and Exact Algorithms ⋮ The Bipartite QUBO ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Unnamed Item ⋮ Probabilistic GRASP-tabu search algorithms for the UBQP problem ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ Linear and quadratic programming approaches for the general graph partitioning problem ⋮ An improved linearization strategy for zero-one quadratic programming problems ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Path relinking for unconstrained binary quadratic programming ⋮ Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ Distributed resource allocation with binary decisions via Newton-like neural network dynamics ⋮ A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem ⋮ A new upper bound for the 0-1 quadratic knapsack problem ⋮ An evolutionary heuristic for quadratic 0-1 programming ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Linear programming for the \(0-1\) quadratic knapsack 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 ⋮ A global continuation algorithm for solving binary quadratic programming problems ⋮ Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem ⋮ One-pass heuristics for large-scale unconstrained binary quadratic problems ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem ⋮ ``Miniaturized linearizations for quadratic 0/1 problems
This page was built for publication: A Decomposition Method for Quadratic Zero-One Programming
