Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
type: Item
instance of: scholarly article
title: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
zbMATH Open document ID: 1403.90481
author: Ivana Ljubić
author: Eduardo Moreno
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6876535
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: branch-and-cut
zbMATH Keywords: maximum capture
zbMATH Keywords: random utility model
zbMATH Keywords: competitive facility location
describes a project that uses: extended-MIQCP
describes a project that uses: Bonmin
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.09.023
OpenAlex ID: W2759930078
Wikidata QID: Q57707439
cites work: Competitive facility location model with concave demand
cites work: Maximizing a class of submodular utility functions
cites work: P-hub approach for the optimal park-and-ride facility location problem
cites work: The maximum capture problem with random utilities: problem formulation and algorithms
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: A branch-and-bound algorithm for the maximum capture problem with random utilities
cites work: Generalized Benders decomposition
cites work: MIP models for connected facility location: a theoretical and computational study
cites work: A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
cites work: Insights into clients' choice in preventive health care facility location planning
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A class of globally convergent optimization methods based on conservative convex separable approximations
cites work: Extended formulations in mixed integer conic quadratic programming
cites work: Maximizing a class of submodular utility functions with constraints
cites work: The impact of client choice on preventive healthcare facility network design
DBLP publication ID: journals/eor/LjubicM18
DOI: 10.1016/J.EJOR.2017.09.023
description: scientific article; zbMATH DE number 6876535