Benders decomposition for congested partial set covering location with uncertain demand

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of the partial set covering location problem, which involves determining a subset of facility locations to open and efficiently allocating customers to these facilities to minimize the combined costs of facil...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research
Hlavní autoři:	Calamita, Alice, Ljubić, Ivana, Palagi, Laura
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2025
Témata:	Combinatorial optimization Mixed-integer convex programming Perspective reformulation Robust optimization Set covering location Robust optimization Combinatorial optimization Set covering location Perspective reformulation Mixed-integer convex programming
ISSN:	0377-2217
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!