Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing-Reference-Cited by-同舟云学术

Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing

Published:2023-10 Issue:1 Volume:310 Page:84-99
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Weninger Dieter^ORCID,Wolsey Laurence A.^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference49 articles.

1. Branching rules revisited;Achterberg;Operations Research Letters,2005

2. A multi-exchange heuristic for the single-source capacitated facility location problem;Ahuja;Management Science,2004

3. A cutting plane algorithm for the capacitated facility location problem;Avella;Computational Optimization and Applications,2009

4. A branch-and-cut algorithm for the single source capacitated facility location problem;Avella,2013

5. A computational study of dicut reformulation for the single source capacitated facility location problem;Avella;Studia Informatica Universalis,2011

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

1. New formulations for two location problems with interconnected facilities;European Journal of Operational Research;2024-04

2. Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities;Computers & Industrial Engineering;2024-02

3. Introduction;Industrial Ecology and Environmental Management;2024