Pages that link to "Item:Q344939"

The following pages link to Approximation algorithms for inventory problems with submodular or routing costs (Q344939):

Displaying 9 items.

• The submodular joint replenishment problem (Q304238) (← links)
• Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
• The subdivision-constrained routing requests problem (Q2436672) (← links)
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem (Q2969619) (← links)
• Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
• Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
• Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)