The Transportation-Location Problem
From MaRDI portal
Publication:5648143
DOI10.1287/opre.20.1.94zbMath0237.90036OpenAlexW2015754576MaRDI QIDQ5648143
Publication date: 1972
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc869067/
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Location-routing: issues, models and methods, Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, A perturbation-based heuristic for the capacitated multisource Weber problem, Solving a large scale districting problem: A case report, Location and layout planning. A survey, Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems, Global optimization algorithm for capacitated multi-facility continuous location-allocation problems, A guided reactive GRASP for the capacitated multi-source Weber problem, Serial dictatorship vs. Nash in assessing Pareto optimality in many-to-many matchings with an application in water management, Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, On queueing-inventory-location problems, A hybrid metaheuristic algorithm for the multi-objective location-routing problem in the early post-disaster stage, The linearized version of an algorithm for the mixed norms problem, A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, GBSSS: The generalized big square small square method for planar single- facility location, Optimization of linear-convex programs, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, The zero pivot phenomenon in transportation and assignment problems and its computational implications, The location-allocation problem of drone base stations, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, Unmanned aerial vehicle hub-location and routing for monitoring geographic borders, A heuristic approach for large scale discrete stochastic transportation- location problems, A family of heuristic solution methods for a class of nonlinear programming problems, Capacitated location-allocation problems on a line, Region-rejection based heuristics for the capacitated multi-source Weber problem, The stochastic transportation-location problem, Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Combined location-routing problems: A synthesis and future research directions, A taxonomical analysis, current methods and objectives on location-routing problems, The \(K\)-connection location problem in a plane
