Lower bounds for nonlinear assignment problems using many body interactions
From MaRDI portal
(Redirected from Publication:1291723)
Recommendations
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 714538 (Why is no real title available?)
- scientific article; zbMATH DE number 970342 (Why is no real title available?)
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A parallel branch and bound algorithm for the quadratic assignment problem
- A parallel shortest augmenting path algorithm for the assignment problem
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- The Backboard Wiring Problem: A Placement Algorithm
- The quadratic assignment problem
Cited in
(2)
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)