☆ 4.7 Article

Continuous covering on networks: Improved mixed integer programming formulations

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Computer Science, Interdisciplinary Applications

Benders decomposition for network design covering problems

Victor Bucarey et al.

Summary: The article discusses two covering variants of the network design problem: the Maximal Covering Network Design problem and the Partial Covering Network Design problem. A Benders decomposition approach is developed to solve these problems, with several stabilization methods considered for determining Benders cuts. Computational experiments demonstrate the efficiency of these different aspects.

COMPUTERS & OPERATIONS RESEARCH (2022)

添加到收藏夹

Article Management

Upgrading edges in the maximal covering location problem

Marta Baldomero-Naranjo et al.

Summary: This study investigates the upgraded version of the maximal covering location problem with edge length modifications on networks. The problem focuses on locating facilities on network vertices to maximize coverage while considering the cost associated with reducing edge lengths within a given budget. This problem is classified as NP-hard on general graphs. To address this, the study proposes three different mixed-integer formulations and a preprocessing phase. Additionally, the proposed formulations are strengthened with valid inequalities and compared using performance tests on various datasets.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

添加到收藏夹

Article Computer Science, Software Engineering

Continuous facility location on graphs

Tim A. Hartmann et al.

Summary: The study focuses on a continuous facility location problem on undirected graphs, aiming to cover the entire graph with a minimum number of facilities. The problem is proven to be polynomially solvable when delta is a unit fraction. However, it becomes NP-hard for all non unit fractions delta. Moreover, the parametrized complexity is analyzed, showing that the problem is fixed parameter tractable for delta < 3/2 and W[2]-hard for delta >= 3/2.

MATHEMATICAL PROGRAMMING (2022)

添加到收藏夹

Review Computer Science, Interdisciplinary Applications

Review of obnoxious facilities location problems

Richard L. Church et al.

Summary: This paper reviews research on the location of obnoxious facilities, emphasizing problem types, solution methods, and historical roots.

COMPUTERS & OPERATIONS RESEARCH (2022)

添加到收藏夹

Article Management

The Obnoxious Facilities Planar p-Median Problem with Variable Sizes *

Pawel Kalczynski et al.

Summary: The paper focuses on the obnoxious facility location problem, which aims to locate facilities that have a negative impact on communities. The goal is to minimize the operating cost of the system while ensuring a minimum distance from communities. The paper proposes a special starting solution method to improve the objective values of non-linear solvers for this non-convex problem.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2022)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Minmax regret maximal covering location problems with edge demands

Marta Baldomero-Naranjo et al.

Summary: This paper addresses a version of the single-facility Maximal Covering Location Problem on a network with uncertain demand distributed along the edges, and proposes a minmax regret model with two polynomial algorithms for finding the location that minimizes the maximal regret. Computational study shows the potential and limits of the proposed methodology for unknown constant demand case.

COMPUTERS & OPERATIONS RESEARCH (2021)

添加到收藏夹

Article Economics

Emergency facility location problems in logistics: Status and perspectives

Wei Wang et al.

Summary: Emergencies can happen anywhere and anytime, and an immediate response is crucial to mitigate potential threats. Determining the optimal number and locations of emergency facilities is of great strategic importance, with researchers commonly approaching the problem as a discrete coverage-based model. This paper provides a comprehensive overview of this problem, discussing mathematical models, solution methods, and future research questions.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)

添加到收藏夹

Article Operations Research & Management Science

The obnoxious facilities planar p-median problem

Pawel Kalczynski et al.

Summary: This paper introduces the planar obnoxious facilities p-median problem and proposes an efficient solution method based on Voronoi diagrams. The efficient frontiers of the test problems are constructed to demonstrate the trade-off between the required distance and the p-median objective, aiding planners in making location decisions.

OR SPECTRUM (2021)

添加到收藏夹

Article Management

Robust, multi-objective optimization for the military medical evacuation location-allocation problem

Phillip R. Jenkins et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2020)

添加到收藏夹

Article Management

Covering polygons with discs: The problem of crane selection and location on construction sites

Dirk Briskorn et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2020)

添加到收藏夹

Article Management

The vertex cover game: Application to transport networks

Vasily V. Gusev

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2020)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Covering edges in networks

Nicolas Froehlich et al.

NETWORKS (2020)

添加到收藏夹

Article Management

The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Zvi Drezner et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2019)

添加到收藏夹

Article Management

Benders decomposition for very large scale partial set covering and maximal covering location problems

Jean-Francois Cordeau et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

The Weber obnoxious facility location model: A Big Arc Small Arc approach

Tammy Drezner et al.

COMPUTERS & OPERATIONS RESEARCH (2018)

添加到收藏夹

Review Operations Research & Management Science

Extensive facility location problems on networks: an updated review

Justo Puerto et al.

TOP (2018)

添加到收藏夹

Article Management

A multiobjective, maximal conditional covering location problem applied to the relocation of hierarchical emergency response facilities

Nicholas R. Paul et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2017)

添加到收藏夹

Article Mathematics, Applied

JuMP: A Modeling Language for Mathematical Optimization

Iain Dunning et al.

SIAM REVIEW (2017)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

Manish Bansal et al.

INFORMS JOURNAL ON COMPUTING (2017)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

On covering location problems on networks with edge demand

Oded Berman et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

添加到收藏夹

Article Operations Research & Management Science

Covering problems in edge- and node-weighted graphs

Takuro Fukunaga

DISCRETE OPTIMIZATION (2016)

添加到收藏夹

Article Management

Maximal Covering Location Problems on networks with regional demand

Rafael Blanquero et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2016)

添加到收藏夹

Article Management

Risk based facility location by using fault tree analysis in disaster management

Ibrahim Akgun et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2015)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Big Segment Small Segment Global Optimization Algorithm on Networks

Oded Berman et al.

NETWORKS (2011)

添加到收藏夹

Article Management

Location optimization of strategic alert sites for homeland defense

John E. Bell et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2011)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A mixed integer linear program and tabu search approach for the complementary edge covering problem

Ali Naimi Sadigh et al.

ADVANCES IN ENGINEERING SOFTWARE (2010)

添加到收藏夹

Article Computer Science, Software Engineering

An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem

I Ljubic et al.

MATHEMATICAL PROGRAMMING (2006)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.