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...

Full description

Bibliographic Details

Published in:	European journal of operational research
Main Authors:	Calamita, Alice, Ljubić, Ivana, Palagi, Laura
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!