25 research outputs found
Proximal and ellipsoid algorithms in convex programming
Issued as Final project report, Project no. G-37-64
A review of network location theory and models
Cataloged from PDF version of article.In this study, we review the existing literature on network location problems.
The study has a broad scope that includes problems featuring desirable and
undesirable facilities, point facilities and extensive facilities, monopolistic and
competitive markets, and single or multiple objectives. Deterministic and
stochastic models as well as robust models are covered. Demand data
aggregation is also discussed. More than 500 papers in this area are reviewed
and critical issues, research directions, and problem extensions are emphasized.Erdoğan, Damla SelinM.S
Algorithmic and technical improvements: Optimal solutions to the (Generalized) Multi-Weber Problem
Rosing has recently demonstrated a new method for obtaining optimal solutions to the (Generalized) Multi-Weber Problem and proved the optimality of the results. The method develops all convex hulls and then covers the destinations with disjoint convex hulls. This paper seeks to improve implementation of the algorithm to make such solutions economically attractive. Four areas are considered: sharper decision rules to eliminate unnecessary searching, bit pattern matching as a method of recording a history and eliminating duplication, vector intrinsic functions to speed up comparisons, and profiling a program to maximize operating efficiency. Computational experience is also presented
Feedback algorithm for switch location : analysis of complexity and application to network design
An accelerated feedback algorithm to solve the single-facility minisum problem is studied with application to designing networks with the star topology. The algorithm, in which the acceleration with respect to the Weiszfeld procedure is achieved by multiplying the current Weiszfeld iterate by an accelerating feedback factor, is shown to converge faster than the accelerating procedures available in the literature. Singularities encountered in the algorithm are discussed in detail. A simple practical exception handling subroutine is developed. Several applications of the algorithm to designing computer networks with the star topology are demonstrated. Applications of the algorithm as a subroutine for multi-switch location problems are considered. Various engineering aspects involved in acquiring and processing coordinates for geographic locations are discussed. A complete algorithm in pseudocode along with the source code listing in Mathematica 4.1 is presented
The Cooperative Maximum Capture Facility Location Problem
In the Maximum Capture Facility Location (MCFL) problem with a binary choice
rule, a company intends to locate a series of facilities to maximize the
captured demand, and customers patronize the facility that maximizes their
utility. In this work, we generalize the MCFL problem assuming that the
facilities of the decision maker act cooperatively to increase the customers'
utility over the company. We propose a utility maximization rule between the
captured utility of the decision maker and the opt-out utility of a competitor
already installed in the market. Furthermore, we model the captured utility by
means of an Ordered Median function (OMf) of the partial utilities of newly
open facilities. We name this problem "the Cooperative Maximum Capture Facility
Location problem" (CMCFL). The OMf serves as a means to compute the utility of
each customer towards the company as an aggregation of ordered partial
utilities, and constitutes a unifying framework for CMCFL models. We introduce
a multiperiod non-linear bilevel formulation for the CMCFL with an embedded
assignment problem characterizing the captured utilities. For this model, two
exact resolution approaches are presented: a MILP reformulation with valid
inequalities and an effective approach based on Benders' decomposition.
Extensive computational experiments are provided to test our results with
randomly generated data and an application to the location of charging stations
for electric vehicles in the city of Trois-Rivi\`eres, Qu\`ebec, is addressed.Comment: 32 pages, 8 tables, 2 algorithms, 8 figure
Combinatorial Optimization
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both basic research and applications in manifold areas such as, for example, communications, economics, traffic, network design, VLSI, scheduling, production, computational biology, to name just a few. Through strong inner ties to other mathematical fields it has been contributing to and benefiting from areas such as, for example, discrete and convex geometry, convex and nonlinear optimization, algebraic and topological methods, geometry of numbers, matroids and combinatorics, and mathematical programming. Moreover, with respect to applications and algorithmic complexity, Combinatorial Optimization is an essential link between mathematics, computer science and modern applications in data science, economics, and industry
Some Applications of the Weighted Combinatorial Laplacian
The weighted combinatorial Laplacian of a graph is a symmetric matrix which is the discrete analogue of the Laplacian operator. In this thesis, we will study a new application of this matrix to matching theory yielding a new characterization of factor-criticality in graphs and matroids. Other applications are from the area of the physical design of very large scale integrated circuits. The placement of the gates includes the minimization of a quadratic form given by a weighted Laplacian. A method based on the dual constrained subgradient method is proposed to solve the simultaneous placement and gate-sizing problem. A crucial step of this method is the projection to the flow space of an associated graph, which can be performed by minimizing a quadratic form given by the unweighted combinatorial Laplacian.Andwendungen der gewichteten kombinatorischen Laplace-Matrix Die gewichtete kombinatorische Laplace-Matrix ist das diskrete Analogon des Laplace-Operators. In dieser Arbeit stellen wir eine neuartige Charakterisierung von Faktor-Kritikalität von Graphen und Matroiden mit Hilfe dieser Matrix vor. Wir untersuchen andere Anwendungen im Bereich des Entwurfs von höchstintegrierten Schaltkreisen. Die Platzierung basiert auf der Minimierung einer quadratischen Form, die durch eine gewichtete kombinatorische Laplace-Matrix gegeben ist. Wir präsentieren einen Algorithmus für das allgemeine simultane Platzierungs- und Gattergrößen-Optimierungsproblem, der auf der dualen Subgradientenmethode basiert. Ein wichtiger Bestandteil dieses Verfahrens ist eine Projektion auf den Flussraum eines assoziierten Graphen, die als die Minimierung einer durch die Laplace-Matrix gegebenen quadratischen Form aufgefasst werden kann