Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
From MaRDI portal
(Redirected from Publication:1754055)
Recommendations
- A multicut outer-approximation approach for competitive facility location under random utilities
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models
- The maximum capture problem with random utilities: problem formulation and algorithms
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- The maximum capture problem with heterogeneous customers
Cites work
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Competitive facility location model with concave demand
- Extended formulations in mixed integer conic quadratic programming
- Generalized Benders decomposition
- Insights into clients' choice in preventive health care facility location planning
- Maximizing a class of submodular utility functions
- Maximizing a class of submodular utility functions with constraints
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- MIP models for connected facility location: a theoretical and computational study
- P-hub approach for the optimal park-and-ride facility location problem
- Solving mixed integer nonlinear programs by outer approximation
- The impact of client choice on preventive healthcare facility network design
- The maximum capture problem with random utilities: problem formulation and algorithms
Cited in
(41)- Approximation of the competitive facility location problem with MIPs
- Effects of multipurpose shopping trips on retail store location in a duopoly
- The maximum capture problem with heterogeneous customers
- The maximum capture problem with random utilities: problem formulation and algorithms
- Solving the facility location and fixed charge solid transportation problem
- 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
- 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
- Fractional 0-1 programming and submodularity
- A multicut outer-approximation approach for competitive facility location under random utilities
- Pricing and collection rate for remanufacturing industry considering capacity constraint in recycling channels
- A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
- Joint location and pricing within a user-optimized environment
- On the linear integration of attraction choice models in business optimization problems
- 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
- A branch-and-bound algorithm for the maximum capture problem with random utilities
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- 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
- 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
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- A logistics provider's profit maximization facility location problem with random utility maximizing followers
- Diversification or pooling? Distributionally robust optimization approach for closed-loop supply chain network design
- Maximum capture location problem with random utilities and overflow penalties
- Bilevel competitive facility location and design under a nested logit model
- Perspectives on optimizing transport systems with supply-dependent demand
- An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming
- Constrained assortment optimization under the mixed-logit model: approximation schemes and outer approximation approaches
- A capacitated collection-and-delivery-point location problem with random utility maximizing customers
- Enumerative algorithms for choice-based pricing under capacity constraints
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
- Title not available (Why is no real title available?)
- Exact approaches for competitive facility location with discrete attractiveness
This page was built for publication: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754055)
