Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Tushar, C.T."

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Integer Linear Programming Models for Variations of the Discrete Semi-obnoxious Facility Location Problem
    (Springer Science and Business Media Deutschland GmbH, 2025) Tushar, C.T.; Singireddy, V.R.; Basappa, M.
    In this work, we consider semi-obnoxious facility location problems, motivated by the following scenario: Suppose an international restaurant brand wants to open a chain of branches in a city that is already occupied by several competing brands. We model this as a geometric optimization problem to provide decision-makers with relevant information on how to economically place k new branches among competitors and how to set prices of items in comparison to nearby competitors. We refer to this as the discrete k-semi-obnoxious facility location (DSofl) problem, classifying it within the context of similar problems in the literature. We introduce two variations of the DSofl problem and propose integer linear programming (ilp) based exact methods for solving both. Additionally, we discuss the implementation of these models using the Gurobi solver. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify