Relocation-promotion problem with Euclidean distance

DOI10.1016/0377-2217(90)90298-PMaRDI QIDQ915640zbMATH OpenFDO

Authors Wilfred V. Huang, Rajan Batta, A. J. G. Babu

Publication date 1990

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

advertisingrelocation-promotion problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Marketing, advertising (90B60) Discrete location and assignment (90B80)

Recommendations

• The Maximum Capture Problem Including Relocation
• Single facility location and relocation problem with time dependent weights and discrete planning horizon
• \(\gamma\)-robust facility relocation problem
• A fast feasibility test for relocation problems
• The maximal expected coverage relocation problem for emergency vehicles

Cites work

• scientific article; zbMATH DE number 3765539 (Why is no real title available?)
• A structure for distribution studies
• An operations-research study of sales response to advertising
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• Locating active sensors on traffic networks
• Locating mobile servers on a network with markovian properties
• Optimal Facility Location for Normally and Exponentially Distributed Points
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The Multiperiod Location-Allocation Problem with Relocation of Facilities

Cited in

(3)

• A fast feasibility test for relocation problems
• A linear program for points of interest relocation in adaptive maps
• The traveling \(k\)-median problem: approximating optimal network coverage

This page was built for publication: Relocation-promotion problem with Euclidean distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915640)