The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem

DOI10.1287/OPRE.47.2.175zbMATH Open0995.90581OpenAlexW2085524290MaRDI QIDQ4545669FDOQ4545669

Authors: Philipp A. Djang, Katta G. Murty 

Publication date: 21 October 2002

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

Full work available at URL: https://doi.org/10.1287/opre.47.2.175

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Cited In (9)

• A taxonomical analysis, current methods and objectives on location-routing problems
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
• Location-routing: issues, models and methods
• Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
• The stop-and-drop problem in nonprofit food distribution networks
• Insertion heuristics for central cycle problems
• Distribution network design on the battlefield
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• The location routing problem using electric vehicles with constrained distance

This page was built for publication: The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem

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