Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Hahn, Peter M.- Department of Electrical and Systems Engineering, University of Pennsylvania
Tree Elaboration Strategies Branch and Bound Algorithms
A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization
Practical Aspects of the Calculation of DP Bounds for the QAP Dual Procedure (DP) provides lower bounds for the branch &
Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation by Peter Hahn, Sci-Tech Services, Inc., 1416 Park Road, Elverson, PA 19520
Multi-story; space assignment; evacuation typeset May 29, 2008 Hahn, Smith, & Zhu The Multi-Story Space Assignment Problem
Tree Elaboration Strategies in B&B Algorithms for the QAP Tree Elaboration Strategies in
BRANCHING STRATEGIES QUADRATIC ASSIGNMENT PROBLEM
A Branch-and-Bound Algorithm for the Quadratic Assignment Problem Based on the Hungarian Method
RECENT ADVANCES AND CHALLENGES IN QUADRATIC ASSIGNMENT AND RELATED PROBLEMS
A Hospital Facility Layout Problem Finally Solved
A STUDY OF QUADRATIC ASSIGNMENT PROBLEM INSTANCES THAT ARE DIFFICULT FOR META-HEURISTIC METHODS
