CVRPSEP

CVRPSEP: A package of seperations routines for the capacitated vehicle routing problem. 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 40 articles )

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

1 2 next

  1. Dalmeijer, Kevin; Desaulniers, Guy: Addressing orientation symmetry in the time window assignment vehicle routing problem (2021)
  2. Rostami, Borzou; Desaulniers, Guy; Errico, Fausto; Lodi, Andrea: Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times (2021)
  3. Marques, Guillaume; Sadykov, Ruslan; Deschamps, Jean-Christophe; Dupas, Rémy: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (2020)
  4. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for vehicle routing and related problems (2020)
  5. Queiroga, Eduardo; Frota, Yuri; Sadykov, Ruslan; Subramanian, Anand; Uchoa, Eduardo; Vidal, Thibaut: On the exact solution of vehicle routing problems with backhauls (2020)
  6. Goeke, Dominik; Gschwind, Timo; Schneider, Michael: Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (2019)
  7. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for Vehicle Routing and related problems (2019)
  8. Dalmeijer, Kevin; Spliet, Remy: A branch-and-cut algorithm for the time window assignment vehicle routing problem (2018)
  9. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  10. Fukasawa, Ricardo; He, Qie; Santos, Fernando; Song, Yongjia: A joint vehicle routing and speed optimization problem (2018)
  11. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (2018)
  12. Domínguez-Martín, Bencomo; Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José: An exact algorithm for a vehicle-and-driver scheduling problem (2017)
  13. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2017)
  14. Gianessi, Paolo; Ceselli, Alberto; Létocart, Lucas; Wolfler Calvo, Roberto: A branch&price&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (2016)
  15. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  16. Spliet, Remy; Desaulniers, Guy: The discrete time window assignment vehicle routing problem (2015)
  17. Battarra, Maria; Pessoa, Artur Alves; Subramanian, Anand; Uchoa, Eduardo: Exact algorithms for the traveling salesman problem with draft limits (2014)
  18. Contardo, Claudio; Martinelli, Rafael: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (2014)
  19. Gauvin, Charles; Desaulniers, Guy; Gendreau, Michel: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (2014)
  20. Hà, Minh Hoàng; Bostel, Nathalie; Langevin, André; Rousseau, Louis-Martin: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (2014)

1 2 next