Publication:3787762
From MaRDI portal
zbMath0644.90030MaRDI QIDQ3787762
Publication date: 1988
network optimization; arc-node problems; candidate sites; heuristic and exact algorithms; Location-routing problems
Related Items
Location and allocation for distribution systems with transshipments and transportion economies of scale, The arc partitioning problem, A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading, Location-routing: issues, models and methods, Heuristic and lower bound for a stochastic location-routing problem, Locating landfills--optimization vs. reality, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, The capacity and distance constrained plant location problem, Vehicle routing considerations in distribution system design, Models and exact solutions for a class of stochastic location-routing problems, Operational estimators for the length of a traveling salesman tour, Optimizing solid waste collection in Brussels, Some personal views on the current state and the future of locational analysis, A multi-modal approach to the location of a rapid transit line, Combined location-routing problems: A synthesis and future research directions, Kohonen maps for solving a class of location-allocation problems, Heuristic solutions to multi-depot location-routing problems, A two-phase tabu search approach to the location routing problem, Distribution network design: New problems and related models, Generalized network design problems., A compact model and tight bounds for a combined location-routing problem, Approximating minimum-cost graph problems with spanning tree edges, Routing problems: A bibliography, An efficient transformation of the generalized vehicle routing problem, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, Solving an urban waste collection problem using ants heuristics, A particle swarm optimization algorithm with path relinking for the location routing problem
