The maximum capture problem with random utilities: problem formulation and algorithms
From MaRDI portal
Publication:1848399
DOI10.1016/S0377-2217(01)00340-XzbMath1082.90543OpenAlexW2034504820MaRDI QIDQ1848399
Publication date: 20 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00340-x
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Competitive location and pricing on networks with random utilities, Design of a location and transportation optimization model including quality of service using constrained multinomial logit, Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation?, Exact approaches for competitive facility location with discrete attractiveness, A branch-and-bound algorithm for the maximum capture problem with random utilities, Classification methods for random utility models with i.i.d. disturbances under the most probable alternative rule, Fractional 0-1 programming and submodularity, On the linear integration of attraction choice models in business optimization problems, A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand, 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, Location and design decisions of facilities in a distribution system with elastic customer demand, A Lagrangian decomposition scheme for choice-based optimization, Joint location and cost planning in maximum capture facility location under random utilities, Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study, Sequential customers' decisions in facility location with comparison-shopping, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Location Science in Canada, 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, Cournot-Stackelberg games in competitive delocation, Competitive Facility Location with Selfish Users and Queues, The computation of the worst conditional expectation., Robust location of new housing developments using a choice model, Retail store location and pricing within a competitive environment using constrained multinomial logit, Outer approximation and submodular cuts for maximum capture facility location problems with random utilities, Strategic design of competing supply chain networks with foresight, A comparison of linear reformulations for multinomial logit choice probabilities in facility location models, Variable neighbourhood search: methods and applications, Insights into clients' choice in preventive health care facility location planning, 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, Variable neighbourhood search: Methods and applications, A choice-based optimization approach for contracting in supply chains, Conditional Location Problems on Networks and in the Plane, A sixth bibliography of fractional programming, Solving a bi-objective unmanned aircraft system location-allocation problem, Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Some personal views on the current state and the future of locational analysis
- Boolean query optimization and the 0-1 hyperbolic sum problem
- The maximum capture problem with heterogeneous customers
- Variable neighborhood decomposition search
- Multinomial Logit Market Share Models: Equilibrium Characteristics and Strategic Implications
- Logit Demand Estimation Under Competitive Pricing Behavior: An Equilibrium Framework
- Competitive Location with Random Utilities
- Product Positioning Under Price Competition
- Competitive Location on a Network
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Variable neighborhood search for the p-median
- Competitive Location Models: A Framework and Bibliography
