Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
From MaRDI portal
Publication:1754055
DOI10.1016/j.ejor.2017.09.023zbMath1403.90481OpenAlexW2759930078WikidataQ57707439 ScholiaQ57707439MaRDI QIDQ1754055
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.09.023
combinatorial optimizationrandom utility modelbranch-and-cutcompetitive facility locationmaximum capture
Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (25)
Exact approaches for competitive facility location with discrete attractiveness ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Fractional 0-1 programming and submodularity ⋮ On the linear integration of attraction choice models in business optimization problems ⋮ A multicut outer-approximation approach for competitive facility location under random utilities ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ A Lagrangian decomposition scheme for choice-based optimization ⋮ Joint location and cost planning in maximum capture facility location under random utilities ⋮ Sequential customers' decisions in facility location with comparison-shopping ⋮ Robust maximum capture facility location under random utility maximization models ⋮ Pricing and collection rate for remanufacturing industry considering capacity constraint in recycling channels ⋮ Service center location problems with decision dependent utilities and a pandemic case study ⋮ The follower competitive facility location problem under the nested logit choice rule ⋮ Approximation of the competitive facility location problem with MIPs ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule ⋮ Distributionally robust facility location problem under decision-dependent stochastic demand ⋮ Joint location and pricing within a user-optimized environment ⋮ A choice-based optimization approach for contracting in supply chains ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ Store location with multipurpose shopping trips and a new random utility customers' choice model ⋮ Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Uses Software
Cites Work
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- Benders decomposition without separability: a computational study for capacitated facility location problems
- The impact of client choice on preventive healthcare facility network design
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- MIP models for connected facility location: a theoretical and computational study
- Competitive facility location model with concave demand
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Extended formulations in mixed integer conic quadratic programming
- The maximum capture problem with random utilities: problem formulation and algorithms
- P-hub approach for the optimal park-and-ride facility location problem
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- Insights into clients' choice in preventive health care facility location planning
- Generalized Benders decomposition
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
This page was built for publication: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
