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 80 articles , 1 standard article )

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

1 2 3 4 next

  1. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  2. Subramanyam, Anirudh; Gounaris, Chrysanthos E.: A branch-and-cut framework for the consistent traveling salesman problem (2016)
  3. Adulyasak, Yossiri; Cordeau, Jean-François; Jans, Raf: The production routing problem: a review of formulations and solution algorithms (2015)
  4. Foulds, Les; Longo, Humberto; Martins, Jean: A compact transformation of arc routing problems into node routing problems (2015)
  5. Letchford, Adam N.; Salazar-González, Juan-José: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (2015)
  6. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  7. Spliet, Remy; Desaulniers, Guy: The discrete time window assignment vehicle routing problem (2015)
  8. Yang, Jun; Sun, Hao: Battery swap station location-routing problem with capacitated electric vehicles (2015)
  9. Adulyasak, Yossiri; Cordeau, Jean-François; Jans, Raf: Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems (2014)
  10. Battarra, Maria; Erdoğan, Güneş; Vigo, Daniele: Exact algorithms for the clustered vehicle routing problem (2014)
  11. Contardo, Claudio; Cordeau, Jean-François; Gendron, Bernard: An exact algorithm based on cut-and-column generation for the capacitated location-routing problem (2014)
  12. Contardo, Claudio; Martinelli, Rafael: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (2014)
  13. Gauvin, Charles; Desaulniers, Guy; Gendreau, Michel: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (2014)
  14. Jabali, Ola; Rei, Walter; Gendreau, Michel; Laporte, Gilbert: Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (2014)
  15. Lysgaard, Jens; Wøhlk, Sanne: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (2014)
  16. Martinelli, Rafael; Pecin, Diego; Poggi, Marcus: Efficient elementary and restricted non-elementary route pricing (2014)
  17. 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)
  18. Miranda-Bront, Juan José; Méndez-Díaz, Isabel; Zabala, Paula: Facets and valid inequalities for the time-dependent travelling salesman problem (2014)
  19. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2014)
  20. Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert: Improved lower bounds and exact algorithm for the capacitated arc routing problem (2013)

1 2 3 4 next