Lower bounds for nonlinear assignment problems using many body interactions

DOI10.1016/S0377-2217(97)00038-6zbMATH Open0957.90075OpenAlexW1997994705MaRDI QIDQ1291723FDOQ1291723

Authors: Bala Ramachandran, Joseph F. Pekny 

Publication date: 22 March 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00038-6

Recommendations

• scientific article; zbMATH DE number 714527
• scientific article; zbMATH DE number 1795730
• Lower bounds for the quadratic assignment problem based upon a dual formulation
• scientific article; zbMATH DE number 970342

zbMATH Keywords

quadratic assignment problemassignment problemsmany body interactionslifting techniques

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Decomposition methods (49M27) Discrete location and assignment (90B80)

Cites Work

• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Assignment Problems and the Location of Economic Activities
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the quadratic assignment problem
• Title not available (Why is that?)
• The quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• A parallel branch and bound algorithm for the quadratic assignment problem
• The Backboard Wiring Problem: A Placement Algorithm
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
• Title not available (Why is that?)
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• A parallel shortest augmenting path algorithm for the assignment problem
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Exact solution of two location problems via branch-and-bound
• A survey for the quadratic assignment problem

Uses Software

• QAPLIB

This page was built for publication: Lower bounds for nonlinear assignment problems using many body interactions

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