scientific article; zbMATH DE number 970341

MaRDI QIDQ5688490zbMATH OpenFDO

Authors K. Ramakrishnan, Mauricio G. C. Resende, Panos M. Pardalos

Publication date 11 March 1997

zbMATH Keywords

branch and boundinterior point algorithmlinear programming relaxationslower boundspreconditioned conjugate gradient algorithmquadratic assignment

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Linear programming (90C05) Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• Lower bounds based on linear programming for the quadratic assignment problem
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• scientific article; zbMATH DE number 714527
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• A branch and bound algorithm for quantified quadratic programming
• Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• A new lower bound for the quadratic assignment problem

Cited in

(11)

• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
• Lower bounds based on linear programming for the quadratic assignment problem
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
• An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
• Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• scientific article; zbMATH DE number 1795730 (Why is no real title available?)
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• Effective formulation reductions for the quadratic assignment problem

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5688490)