Quadratic assignment problems
RE Burkard - European Journal of Operational Research, 1984 - Elsevier
This paper surveys quadratic assignment problems (QAP). At first several applications of this
problem class are described and mathematical formulations of QAPs are given. Then some …
problem class are described and mathematical formulations of QAPs are given. Then some …
[KÖNYV][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
Metaheuristics: A bibliography
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …
the last two decades. They have had widespread successes in attacking a variety of difficult …
Greedy randomized adaptive search procedures: Advances, hybridizations, and applications
GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …
iteration consists basically of two phases: construction and local search. The construction …
[KÖNYV][B] The quadratic assignment problem
The quadratic assignment problem (QAP) was introduced by Koopmans and Beckmann in
1957 as a mathematical model for the location of a set of indivisible economical activities …
1957 as a mathematical model for the location of a set of indivisible economical activities …
Berth allocation with service priority
Over the past several years, port related charges in Japanese ports have been substantially
higher than those charged in other major international hub ports. All major container ports in …
higher than those charged in other major international hub ports. All major container ports in …
An annotated bibliography of GRASP–Part II: Applications
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …
Probability distribution of solution time in GRASP: An experimental investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for
combinatorial optimization. We study the probability distributions of solution time to a sub …
combinatorial optimization. We study the probability distributions of solution time to a sub …
Greedy randomized adaptive search procedures: advances and extensions
A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …
combinatorial optimization problems, in which each iteration consists basically of two …
GRASP: Greedy randomized adaptive search procedures
GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …
iteration consists basically of two phases: construction and local search. The construction …