Discrete location problems with push-pull objectives
48
TL;DR: An overview of a number of push-pull models, yielding alternative ways to incorporate both types of effects simultaneously, restricted to models of combinatorial optimisation and includes indications of reduction to standard models and/or algorithmic approaches where possible.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 15 Nov 2002. and is currently open access. The article focuses on the topics: Combinatorial optimization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Habilitation a diriger des recherches
L’Étude Mathématique,De Quelques Modèles,Issus De La,Physique Statistique,Hors Équilibre,Stéphane Mischler,En Mathématiques,Pierre Degond,Laurent Desvillettes,François Golse,Otared Kavian,Benoît Perthame,Jean-Pierre Puel,Mario Pulvirenti,Mais la vache,savait nager +15 more
- 01 Jan 2004
TL;DR: Granvorka et al. as discussed by the authors present le Ceregmia de Travail, le document de travail published en 2010 by the International Association of Christians and Jews (IAC) in Haiti.
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
TL;DR: This paper presents QCR, a general method to reformulate (QP) into an equivalent 0-1 program with a convex quadratic objective function, and shows that QCR is optimal in a certain sense.
135
Optimally locating in-house logistics areas to facilitate JIT-supply of mixed-model assembly lines
Simon Emde,Nils Boysen +1 more
TL;DR: In this paper, the decision problem of determining the optimal number and placement of supermarkets on the shop floor is investigated in a comprehensive computational study, and the validity of the proposed approach for practical purposes as well as the trade-off resulting from fixed installation and maintenance cost is investigated.
111
A comparative survey of service facility location problems
TL;DR: A classification based on 19 main characteristics including key features and descriptive dimensions of location problems is presented in order to develop a taxonomy from an operations research perspective to assist the location scientists and practitioners who work on service facility location problems.
105
Upper bounds and exact algorithms for p-dispersion problems
TL;DR: The p-dispersion-sum problem is the problem of locating p facilities at some of n predefined locations, such that the distance sum between the p facilities is maximized, and a solution algorithm based on transformation of the p- Dispersion problem to the p
96
References
•Book
Handbook of Combinatorial Optimization
Ding-Zhu Du,Panos M. Pardalos +1 more
- 31 Oct 1998
TL;DR: The Steiner Ratio of Banach-Minkowski Space and Probabilistic Verification and Non-Approximability and Network-Based Model and Algorithms in Data Mining and Knowledge Discovery are studied.
Equity measurement in facility location analysis: A review and framework
TL;DR: In this article, the authors provide a base from which issues of equity can be included in facility siting models and discuss approaches that can be used to select an appropriate measure of equity.
477
Analytical models for locating undesirable facilities
Erhan Erkut,Susan Neuman +1 more
TL;DR: A survey of the maximization location models in the Operations Research literature is contained, and a synthesis of the solution procedures with emphasis on similarities and differences is presented.
437
Quadratic knapsack problems
Giorgio Gallo,Peter L. Hammer,Bruno Simeone +2 more
- 01 Jan 1980
TL;DR: The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics as discussed by the authors, and its use in branch-and-bound schemes for solving such problems is well-known.
313