A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints-Reference-Cited by-同舟云学术

A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints

Published:2016-06 Issue:4 Volume:50 Page:1286-1299
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Gendron Bernard,Khuong Paul-Virak,Semet Frédéric

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/trsc.2016.0692

Reference42 articles.

1. On the Two-Level Uncapacitated Facility Location Problem

2. Branching rules revisited

3. Near-optimal solutions to large-scale facility location problems

4. Barros AI (1995) Discrete and fractional programming techniques for location models. Unpublished doctoral thesis, Erasmus University Rotterdam, Rotterdam, Netherlands.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. OREO: O-RAN intElligence Orchestration of xApp-based network services;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

2. Sparse Facility Location and Network Design Problems;2024

3. Facility Location: A Guide to Modeling and Solving Complex Problem Variants via Lagrangian Relaxation Heuristics;International Series in Operations Research & Management Science;2024

4. Models and Methods for Two-Level Facility Location Problems;International Series in Operations Research & Management Science;2024

5. A continuum approximation approach to the depot location problem in a crowd-shipping system;Transportation Research Part E: Logistics and Transportation Review;2023-08