Efficient solution approaches for a discrete multi-facility competitive interaction model

DOI10.1007/s10479-008-0337-yzbMath1163.90581OpenAlexW2080610036MaRDI QIDQ1026599

Robert Aboolian, Dmitry Krass, Oded Berman

Publication date: 25 June 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0337-y

zbMATH Keywords

approximationspatial interaction modelscompetitive facility locationnonseparable convex knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (8)

Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? ⋮ A leader-follower model for discrete competitive facility location ⋮ Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness ⋮ The gravity multiple server location problem ⋮ Competitive facility location with random attractiveness ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Big segment small segment global optimization algorithm on networks ⋮ Two-player simultaneous location game: preferential rights and overbidding

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive facility location model with concave demand
• Competitive facility location and design problem
• On a discrete nonlinear and nonseparable knapsack problem
• GBSSS: The generalized big square small square method for planar single- facility location
• The nonlinear knapsack problem - algorithms and applications
• Solving the multiple competitive facilities location problem
• Convex quadratic programming with one constraint and bounded variables
• Quadratic knapsack problems
• Replacing continuous demand with discrete demand in a competitive location model
• Exact Solution of the Quadratic Knapsack Problem

This page was built for publication: Efficient solution approaches for a discrete multi-facility competitive interaction model