[BOOK][B] Geometry of cuts and metrics

M Deza, M Laurent, R Weismantel - 1997 - Springer
Cuts and metrics are well-known objects that arise-independently, but with many deep and
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …

Arc routing problems, part I: The Chinese postman problem

HA Eiselt, M Gendreau, G Laporte - Operations Research, 1995 - pubsonline.informs.org
Arc routing problems arise in several areas of distribution management and have long been
the object of study by mathematicians and operations researchers. In the first of a two-part …

Arc routing problems, part II: The rural postman problem

HA Eiselt, M Gendreau, G Laporte - Operations research, 1995 - pubsonline.informs.org
This is the second half of a two-part survey on arc routing problems. The first part appeared
in the March–April 1995 issue of this journal. Here, the rural postman problem (RPP) is …

On the approximation of maximum satisfiability

M Yannakakis - Journal of Algorithms, 1994 - Elsevier
We present a 3/4 polynomial time approximation algorithm for the Maximum Satisfiability
problem: Given a set of clauses, find a truth assignment that satisfies the maximum number …

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

P Hahn, T Grant, N Hall - European Journal of Operational Research, 1998 - Elsevier
This paper presents a new branch-and-bound algorithm for solving the quadratic
assignment problem (QAP). The algorithm is based on a dual procedure (DP) similar to the …

Improving patient timeliness of care through efficient outpatient clinic layout design using data-driven simulation and optimisation

V Vahdat, A Namin, R Azghandi, J Griffin - Health Systems, 2019 - Taylor & Francis
With greater demand for outpatient services, the importance of patient-centric clinic layout
design that improves timeliness of patient care has become more elucidated. In this paper, a …

[PDF][PDF] A survey of the quadratic assignment problem, with applications

CW Commander - 2005 - scholarworks.moreheadstate.edu
Abstract The Quadratic Assignment Problem (QAP) is one of the most interesting and most
challenging combinatorial optimization problems in existence. This paper will be a survey of …

[BOOK][B] Stock location assignment and order picking productivity

EH Frazelle - 1989 - search.proquest.com
Given a set of items and associated space requirements, a warehouse layout, and an order
batching and pick sequencing policy, the stock location assignment problem (SLAP) is the …

NP-completeness: A retrospective

CH Papadimitriou - International Colloquium on Automata, Languages …, 1997 - Springer
For a quarter of a century now, NP-completeness has been computer science's favorite
paradigm, fad, punching bag, buzzword, alibi, and intellectual export. This paper is a …

Solving the reliability-oriented generalized assignment problem by Lagrangian relaxation and Alternating Direction Method of Multipliers

M Song, L Cheng - Expert Systems with Applications, 2022 - Elsevier
The well-known generalized assignment problem has many real-world applications. The
assignment costs between agents and tasks affected by several factors could be unstable …