A Review of the Placement and Quadratic Assignment Problems

The Hungarian method for the assignment problem

1955 • 11,128 citations

On the shortest spanning subtree of a graph and the traveling salesman problem

1956 • 4,806 citations

Shortest Connection Networks And Some Generalizations

1957 • 4,371 citations

Algorithms for the Assignment and Transportation Problems

1957 • 3,764 citations

Branch-and-Bound Methods: A Survey

1966 • 1,915 citations

The Quadratic Assignment Problem

1963 • 955 citations

On Steiner’s Problem with Rectilinear Distance

1966 • 626 citations

An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

1968 • 567 citations

Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

1962 • 445 citations

The Backboard Wiring Problem: A Placement Algorithm

1961 • 384 citations

Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities

1966 • 232 citations

Formal Procedures for Connecting Terminals with a Minimum Total Wire Length

1957 • 68 citations

On Approximation Methods for the Assignment Problem

1962 • 65 citations

ACCEL: Automated circuit card etching layout

1967 • 57 citations

General survey of design automation of digital computers

1966 • 47 citations

Statistical Properties of the Placement of a Graph

1968 • 31 citations

An algorithm for placement of interconnected elements based on minimum wire length

1964 • 28 citations

An algorithm for minimizing backboard wiring functions

1965 • 16 citations

Formulation and Solution of Circuit Card Design Problems through Use of Graph Methods

1962 • 11 citations

Permutation procedure for the backboard-wiring problem

1968 • 10 citations

The formulation of some allocation and connection problems as integer programs

1966 • 9 citations

The Placement of Computer Logic Modules

1966 • 8 citations

On Minimization of Backboard Wiring Functions

1967 • 3 citations

Automatic Packaging of Miniaturized Circuits

1962 • 2 citations