Some new clique inequalities in four-index hub location models
Year of publication: |
2024
|
---|---|
Authors: | Landete, Mercedes ; Peiró, Juanjo |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 318.2024, 3 (1.11.), p. 768-777
|
Subject: | Branch and cut | Combinatorial optimization | Conflict graph | Location | Set packing | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Operations Research | Operations research | Standorttheorie | Location theory | Betriebliche Standortwahl | Firm location choice | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
The Ordered Median Tree Location Problem
Pozo, Miguel A., (2024)
-
Approximation algorithms for hard capacitated k-facility location problems
Aardal, Karen, (2015)
- More ...
-
The facility location problem with capacity transfers
Corberán, Ángel, (2020)
-
Heuristics for the capacitated dispersion problem
Peiró, Juanjo, (2020)
-
GRASP for the uncapacitated r-allocation p-hub median problem
Peiró, Juanjo, (2014)
- More ...