Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms

Max-plus based methods have been recently developed to approximate the value function of possibly high dimensional optimal control problems. A critical step of these methods consists in approximating a function by a supremum of a small number of functions (max-plus "basis functions") taken from a prescribed dictionary. We study several variants of this approximation problem, which we show to be continuous versions of the facility location and $k$-center combinatorial optimization problems, in which the connection costs arise from a Bregman distance. We give theoretical error estimates, quantifying the number of basis functions needed to reach a prescribed accuracy. We derive from our approach a refinement of the curse of dimensionality free method introduced previously by McEneaney, with a higher accuracy for a comparable computational cost.Comment: 8pages 5 figure

A bi-objective model for emergency services location-allocation problem with maximum distance constraint

In this paper, a bi-objective mathematical model for emergency services location-allocation problem on a tree network considering maximum distance constraint is presented. The first objective function called centdian is a weighted mean of a minisum and a minimax criterion and the second one is a maximal covering criterion. For the solution of the bi-objective optimization problem, the problem is split in two sub problems: the selection of the best set of locations, and a demand assignment problem to evaluate each selection of locations. We propose a heuristic algorithm to characterize the efficient location point set on the network. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithms

Survey on Combinatorial Register Allocation and Instruction Scheduling

Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation time. This paper provides an exhaustive literature review and a classification of combinatorial optimization approaches to register allocation and instruction scheduling, with a focus on the techniques that are most applied in this context: integer programming, constraint programming, partitioned Boolean quadratic programming, and enumeration. Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential benefit of applying combinatorial optimization

Holographic Higgs Phases

We discuss phases of gauge theories in the holographic context, and formulate a criterion for the existence of a Higgs phase, where the gauge redundancy is "spontaneously broken", in purely bulk language. This condition, the existence of a finite tension solitonic string representing a narrow magnetic flux tube, is necessary for a bulk theory to be interpreted as a Higgs phase of a boundary gauge theory. We demonstrate the existence of such solitons in both top-down and bottom-up examples of holographic theories. In particular, we numerically construct new solitonic solutions in AdS black hole background, for various values of the boundary gauge coupling, which are used to demonstrate that the bulk theory models a superconductor, rather than a superfluid. The criterion we find is expected to be useful in finding holographic duals of color superconducting phases of gauge theories at finite density.Comment: Corrected typo

Valid Inequalities and Facets of the Capacitated Plant Location Problem

Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems.In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure.The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with constant capacity K for all plants. These facet inequalities depend on K and thus differ fundamentally from the valid inequalities for the uncapacitated version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope

Locating Post Offices Using Fuzzy Goal Programming and Geographical Information System (GIS)

This paper deals with the problem of locating new post offices in a megacity. To do so, a combination of geographicalinformation system (GIS) and fuzzy goal programming (FGP) is used. In order to locate new offices, first six types of servicefacilities with high levels of interactions with post offices are defined. Then, aspiration level of proximity for each servicefacility is determined. Based on these values, a fuzzy goal programming model is constructed to find potential locations offacilities. In order to determine the optimal locations among potential facilities, a maximal covering location problem(MCLP) is solved and results are reported. Results show that although the current state is near-optimal, for future expansionsof the network, the government should spend money on central and southern parts of this megacity

Wormholes and masses for Goldstone bosons

There exist non-trivial stationary points of the Euclidean action for an axion particle minimally coupled to Einstein gravity, dubbed wormholes. They explicitly break the continuos global shift symmetry of the axion in a non-perturbative way, and generate an effective potential that may compete with QCD depending on the value of the axion decay constant. In this paper, we explore both theoretical and phenomenological aspects of this issue. On the theory side, we address the problem of stability of the wormhole solutions, and we show that the spectrum of the quadratic action features only positive eigenvalues. On the phenomenological side, we discuss, beside the obvious application to the QCD axion, relevant consequences for models with ultralight dark matter, black hole superradiance, and the relaxation of the electroweak scale. We conclude discussing wormhole solutions for a generic coset and the potential they generate.Comment: 50 pages, 15 figures. v2: minor changes, refs adde