scientific article; zbMATH DE number 6913886
From MaRDI portal
Publication:4577928
zbMATH Open1392.90010MaRDI QIDQ4577928FDOQ4577928
Publication date: 6 August 2018
Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/4528
Title of this publication is not available (Why is that?)
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (5)
- Polyhedral study of the capacitated vehicle routing problem
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Development of an algorithm for solving an asymmetric routing problem based on the ant colony method
- Combined route capacity and route length models for unit demand vehicle routing problems
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Models, relaxations and exact approaches for the capacitated vehicle routing problem π π
- On the capacitated vehicle routing problem π π
- Modeling and solving the mixed capacitated general routing problem π π
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation π π
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem π π
- Combined route capacity and route length models for unit demand vehicle routing problems π π
- Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types π π
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees π π
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach π π
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577928)