Pages that link to "Item:Q1761192"

The following pages link to The inventory-routing problem with transshipment (Q1761192):

Displaying 45 items.

• An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← links)
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• The synchronized arc and node routing problem: application to road marking (Q336355) (← links)
• Headquarter-centered common sourcing management through order coordination and consolidation (Q336428) (← links)
• Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
• Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
• Location arc routing problem with inventory constraints (Q342552) (← links)
• GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
• Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
• The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment (Q1651650) (← links)
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
• Modeling a green inventory routing problem for perishable products with horizontal collaboration (Q1652462) (← links)
• The dynamic bowser routing problem (Q1711454) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Data-driven assignment of delivery patterns with handling effort considerations in retail (Q1782198) (← links)
• Exact solution methods for the multi-period vehicle routing problem with due dates (Q2002858) (← links)
• Cross docking for libraries with a depot (Q2029401) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• Modeling emergency response operations: a theory building survey (Q2177817) (← links)
• Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials (Q2200132) (← links)
• The inventory routing problem with demand moves (Q2226502) (← links)
• Spare parts inventory routing problem with transshipment and substitutions under stochastic demands (Q2240378) (← links)
• An integrated framework for inventory management and transportation of refined petroleum products: pipeline or marine? (Q2295137) (← links)
• Coalition-formation problem for cooperative inventory routing game (Q2331485) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
• The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
• A mathematical programming-based heuristic for the production routing problem with transshipments (Q2664374) (← links)
• Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands (Q2668678) (← links)
• An iterative matheuristic for the inventory routing problem (Q2668692) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• A matheuristic for solving inventory sharing problems (Q2669710) (← links)
• Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
• An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation (Q2980176) (← links)
• A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)