Optimal sequential replenishment of ships during combat

DOI10.1002/1520-6750(199110)38:5%3C637::AID-NAV3220380502%3E3.0.CO;2-BMaRDI QIDQ3356018zbMATH OpenOpenAlexFDO

Authors S. E. Pilnick, Kevin D. Glazebrook, D. P. jun. Gaver

Publication date 1991

Full work available at URL https://doi.org/10.1002/1520-6750(199110)38:5%3C637::aid-nav3220380502%3E3.0.co;2-b

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Stochastic systems in control theory (general) (93E03)

Cites work

• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 4087408 (Why is no real title available?)

This page was built for publication: Optimal sequential replenishment of ships during combat

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