CVRPSP

The CVRPSEP package is a collection of routines, written in the C programming language, for separation of various classes of cuts in branch-and-cut algorithms for the Capacitated Vehicle Routing Problem. The routines are those that were used in ”A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem” (by Lysgaard, Letchford, and Eglese, published in Mathematical Programming - see Publications). The package contains separation routines for rounded capacity inequalities, homogeneous multistar inequalities, generalized multistar inequalities, framed capacity inequalities, strengthened comb inequalities, and hypotour inequalities. In addition, the package contains a routine for generating candidate sets for branching.


References in zbMATH (referenced in 71 articles , 1 standard article )

Showing results 1 to 20 of 71.
Sorted by year (citations)

1 2 3 4 next

  1. Foulds, Les; Longo, Humberto; Martins, Jean: A compact transformation of arc routing problems into node routing problems (2015)
  2. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  3. Battarra, Maria; Erdoğan, Güneş; Vigo, Daniele: Exact algorithms for the clustered vehicle routing problem (2014)
  4. Contardo, Claudio; Martinelli, Rafael: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (2014)
  5. Jabali, Ola; Rei, Walter; Gendreau, Michel; Laporte, Gilbert: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (2014)
  6. Lysgaard, Jens; Wøhlk, Sanne: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (2014)
  7. Martinelli, Rafael; Pecin, Diego; Poggi, Marcus: Efficient elementary and restricted non-elementary route pricing (2014)
  8. Masson, Renaud; Ropke, Stefan; Lehuédé, Fabien; Péton, Olivier: A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (2014)
  9. Miranda-Bront, Juan José; Méndez-Díaz, Isabel; Zabala, Paula: Facets and valid inequalities for the time-dependent travelling salesman problem (2014)
  10. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2014)
  11. Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert: Improved lower bounds and exact algorithm for the capacitated arc routing problem (2013)
  12. Batsyn, Mikhail; Goldengorin, Boris; Kocheturov, Anton; Pardalos, Panos M.: Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem (2013)
  13. Ceselli, A.; Righini, G.; Tresoldi, E.: Modeling and solving profitable location and distribution problems (2013)
  14. Çetinkaya, Cihan; Karaoglan, Ismail; Gökçen, Hadi: Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (2013)
  15. Gounaris, Chrysanthos E.; Wiesemann, Wolfram; Floudas, Christodoulos A.: The robust capacitated vehicle routing problem under demand uncertainty (2013)
  16. Hà, Minh Hoàng; Bostel, Nathalie; Langevin André; Rousseau, Louis-Martin: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices (2013)
  17. Schmid, Verena; Doerner, Karl F.; Laporte, Gilbert: Rich routing problems arising in supply chain management (2013)
  18. Subramanian, Anand; Uchoa, Eduardo; Pessoa, Artur Alves; Ochi, Luiz Satoru: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (2013)
  19. Baldacci, Roberto; Mingozzi, Aristide; Roberti, Roberto: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (2012)
  20. Bode, Claudia; Irnich, Stefan: Cut-first branch-and-price-second for the capacitated arc-routing problem (2012)

1 2 3 4 next