The following pages link to Leandro C. Coelho (Q337008):
Displaying 41 items.
- Optimal joint replenishment, delivery and inventory management policies for perishable products (Q337009) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- The exact solution of several classes of inventory-routing problems (Q340258) (← links)
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
- The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- The open vehicle routing problem with decoupling points (Q1681358) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Determining time-dependent minimum cost paths under several objectives (Q1722968) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
- Sequential versus integrated optimization: production, location, inventory control, and distribution (Q1754314) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- The two-echelon production-routing problem (Q2028880) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- Modeling and solving the waste valorization production and distribution scheduling problem (Q2106755) (← links)
- Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
- Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- The exact solutions of several types of container loading problems (Q2301942) (← links)
- Optimizing drinking water distribution system operations (Q2327640) (← links)
- Replenishment and denomination mix of automated teller machines with dynamic forecast demands (Q2337393) (← links)
- Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← links)
- The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- The dial-a-ride problem with private fleet and common carrier (Q2676338) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization (Q2676381) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 (Q5879644) (← links)
- The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)
- An exact method for a last-mile delivery routing problem with multiple deliverymen (Q6572895) (← links)
- Reducing the supply-chain nervosity thanks to flexible planning (Q6619798) (← links)
