200 research outputs found

    A spanning tree approach to the absolute p-center problem

    Get PDF
    Cataloged from PDF version of article.We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose p-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees. © 1999 Elsevier Science Ltd. All rights reserved

    Optimizing fire station locations for the Istanbul metropolitan municipality

    Get PDF
    Copyright @ 2013 INFORMSThe Istanbul Metropolitan Municipality (IMM) seeks to determine locations for additional fire stations to build in Istanbul; its objective is to make residences and historic sites reachable by emergency vehicles within five minutes of a fire station’s receipt of a service request. In this paper, we discuss our development of a mathematical model to aid IMM in determining these locations by using data retrieved from its fire incident records. We use a geographic information system to implement the model on Istanbul’s road network, and solve two location models—set-covering and maximal-covering—as what-if scenarios. We discuss 10 scenarios, including the situation that existed when we initiated the project and the scenario that IMM implemented. The scenario implemented increases the city’s fire station coverage from 58.6 percent to 85.9 percent, based on a five-minute response time, with an implementation plan that spans three years

    A spanning tree approach to the absolute p-center problem

    Get PDF
    We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose p-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees. © 1999 Elsevier Science Ltd. All rights reserved

    Trace Anomaly in Quantum Spacetime Manifold

    Full text link
    In this paper we investigate the trace anomaly in a spacetime where single events are de-localized as a consequence of short distance quantum coordinate fluctuations. We obtain a modified form of heat kernel asymptotic expansion which does not suffer from short distance divergences. Calculation of the trace anomaly is performed using an IR regulator in order to circumvent the absence of UV infinities. The explicit form of the trace anomaly is presented and the corresponding 2D Polyakov effective action and energy momentumtensor are obtained. The vacuum expectation value of the energy momentum tensor in the Boulware, Hartle-Hawking and Unruh vacua is explicitly calculated in a (rt)-section of a recently found, noncommutative geometry inspired, Schwarzschild-like solution of the Einstein equations. The standard short distance divergences in the vacuum expectation values are regularized in agreement with the absence of UV infinities removed by quantum coordinate fluctuations.Comment: 15pages, RevTex, no figures, 1 Tabl

    On renormalizability of the massless Thirring model

    Full text link
    We discuss the renormalizability of the massless Thirring model in terms of the causal fermion Green functions and correlation functions of left-right fermion densities. We obtain the most general expressions for the causal two-point Green function and correlation function of left-right fermion densities with dynamical dimensions of fermion fields, parameterised by two parameters. The region of variation of these parameters is constrained by the positive definiteness of the norms of the wave functions of the states related to components of the fermion vector current. We show that the dynamical dimensions of fermion fields calculated for causal Green functions and correlation functions of left-right fermion densities can be made equal. This implies the renormalizability of the massless Thirring model in the sense that the ultra-violet cut-off dependence, appearing in the causal fermion Green functions and correlation functions of left-right fermion densities, can be removed by renormalization of the wave function of the massless Thirring fermion fields only.Comment: 17 pages, Latex, the contribution of fermions with opposite chirality is added,the parameterisation of fermion determinant by two parameters is confirmed,it is shown that dynamical dimensions of fermion fields calculated from different correlation functions can be made equal.This allows to remove the dependence on the ultra-violet cut-off by the renormalization of the wave function of Thirring fermion fields onl

    Are there Local Minima in the Magnetic Monopole Potential in Compact QED?

    Full text link
    We investigate the influence of the granularity of the lattice on the potential between monopoles. Using the flux definition of monopoles we introduce their centers of mass and are able to realize continuous shifts of the monopole positions. We find periodic deviations from the 1/r1/r-behavior of the monopole-antimonopole potential leading to local extrema. We suppose that these meta-stabilities may influence the order of the phase transition in compact QED.Comment: 11 pages, 5 figure

    Locating temporary shelter areas after an earthquake: A case for Turkey

    Get PDF
    In this study, we propose a mixed integer linear programming based methodology for selecting the location of temporary shelter sites. The mathematical model maximizes the minimum weight of open shelter areas while deciding on the location of shelter areas, the assigned population points to each open shelter area and controls the utilization of open shelter areas. We validate the mathematical model by generating a base case scenario using real data for Kartal, Istanbul, Turkey. Also, we perform a sensitivity analysis on the parameters of the mentioned mathematical model and discuss our findings. Lastly, we perform a case study using the data from the 2011 Van earthquake. © 2014 Elsevier B.V. All rights reserved

    Optimizing fire station locations for the Istanbul metropolitan municipality

    Get PDF
    Copyright @ 2013 INFORMSThe Istanbul Metropolitan Municipality (IMM) seeks to determine locations for additional fire stations to build in Istanbul; its objective is to make residences and historic sites reachable by emergency vehicles within five minutes of a fire station’s receipt of a service request. In this paper, we discuss our development of a mathematical model to aid IMM in determining these locations by using data retrieved from its fire incident records. We use a geographic information system to implement the model on Istanbul’s road network, and solve two location models—set-covering and maximal-covering—as what-if scenarios. We discuss 10 scenarios, including the situation that existed when we initiated the project and the scenario that IMM implemented. The scenario implemented increases the city’s fire station coverage from 58.6 percent to 85.9 percent, based on a five-minute response time, with an implementation plan that spans three years

    Premium e-grocery: exploring value in logistics integrated service solutions

    Get PDF
    E-grocery is gradually becoming viable or a necessity for many families. Yet, most e-supermarketsare seen as providers of low value “staple” and bulky goods mainly. While each store has a large number of SKU available, these products are mainly necessity goods with low marginal value for hedonistic consumption. A need to acquire diverse products (e.g., organic), premium priced products (e.g., wine) for special occasions (e.g., anniversary, birthday), or products just for health related reasons (e.g., allergies, diabetes) are yet to be served via one-stop e-tailers. In this paper, we design a mathematical model that takes into account consumers’ geo demographics and multi-product sourcing capacity for creating critical mass and profit. Our mathematical model is a variant of Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), which we extend by adding intermediate locations for trucks to meet and exchange goods. We illustrate our model for the city of Istanbul using GIS maps, and discuss its various extensions as well as managerial implications.TÜBİTAK ; Migros T.A.Ş

    Submucosal diclofenac for acute postoperative pain in third molar surgery: A randomized, controlled clinical trial

    Get PDF
    Diclofenac sodium is a widely used nonsteroidal anti-inflammatory drug (NSAID) for relief of inflammatory pain. A recent formulation combines this drug with hydroxypropyl-β-cyclodextrin (HPβCD) to improve its solubility and to enable subcutaneous administration. Previous studies confirmed the efficacy of this combination. This study’s aim was to evaluate the efficacy, safety, and local tolerability of diclofenac HPβCD administered as a local submucosal injection prior to lower third molar surgery. We conducted a prospective, randomized, double-blind, placebo-controlled, parallel-group phase II single-center study. Seventy-five patients requiring mandibular third molar surgery were randomized into 1 of 5 groups: 5 mg/1 mL diclofenac HPβCD, 12.5 mg/1 mL diclofenac HPβCD, 25 mg/1 mL diclofenac HPβCD, 50 mg/1 mL diclofenac HPβCD, or 1 mL placebo. The respective study drug was injected into the mucosal tissue surrounding the surgical site prior to surgery following achievement of local anesthesia. The primary outcome measure was the area under the curve (AUC) of cumulative pain scores from end of surgery to 6 h postsurgery. This demonstrated a global treatment effect between the active groups and placebo, hence confirming the study drug’s efficacy (P = 0.0126). Secondary outcome measures included the time until onset of pain and the time until patients required rescue medication, both showing statistical significance of the study drug compared to placebo (P < 0.0161 and P < 0.0001, respectively). The time until rescue medication ranged between 7.8 h (for 25 mg/1 mL diclofenac HPβCD) and 16 h (for 50 mg/1 mL diclofenac HPβCD). Interestingly, the 5-mg/1-mL solution appeared superior to the 12.5-mg/1-mL and 25-mg/1-mL solutions (time until rescue medication = 12.44 h). A total of 14% of patients experienced minor adverse drug reactions (ADRs), of which 2 cases demonstrated flap necrosis. These resolved without further intervention. The study results overall indicate efficacy, safety, and relative tolerability of diclofenac HPβCD used locally as a submucosal injection prior to third molar surgery (ClinicalTrials.gov NCT01706588)
    corecore