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

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

1 2 3 4 5 6 next

  1. Baller, Annelieke C.; Dabia, Said; Desaulniers, Guy; Dullaert, Wout E. H.: The inventory routing problem with demand moves (2021)
  2. Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio: A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (2021)
  3. Heßler, Katrin; Irnich, Stefan: A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (2021)
  4. Agarwal, Yogesh Kumar; Venkateshan, Prahalad: A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (2020)
  5. Alvarez, Aldair; Cordeau, Jean-François; Jans, Raf; Munari, Pedro; Morabito, Reinaldo: Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (2020)
  6. Aziez, Imadeddine; Côté, Jean-François; Coelho, Leandro C.: Exact algorithms for the multi-pickup and delivery problem with time windows (2020)
  7. Chitsaz, Masoud; Cordeau, Jean-François; Jans, Raf: A branch-and-cut algorithm for an assembly routing problem (2020)
  8. Ghosal, Shubhechyya; Wiesemann, Wolfram: The distributionally robust chance-constrained vehicle routing problem (2020)
  9. 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)
  10. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for vehicle routing and related problems (2020)
  11. Subramanyam, Anirudh; Gounaris, Chrysanthos E.; Wiesemann, Wolfram: (K)-adaptability in two-stage mixed-integer robust optimization (2020)
  12. Subramanyam, Anirudh; Repoussis, Panagiotis P.; Gounaris, Chrysanthos E.: Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty (2020)
  13. Bektaş, Tolga; Gouveia, Luis; Martínez-Sykora, Antonio; Salazar-González, Juan-José: Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (2019)
  14. Chitsaz, Masoud; Cordeau, Jean-François; Jans, Raf: A unified decomposition matheuristic for assembly, production, and inventory routing (2019)
  15. Letchford, Adam N.; Salazar-González, Juan-José: The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (2019)
  16. Salavati-Khoshghalb, Majid; Gendreau, Michel; Jabali, Ola; Rei, Walter: An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (2019)
  17. Dalmeijer, Kevin; Spliet, Remy: A branch-and-cut algorithm for the time window assignment vehicle routing problem (2018)
  18. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  19. de Oliveira da Costa, Paulo Roberto; Mauceri, Stefano; Carroll, Paula; Pallonetto, Fabiano: A genetic algorithm for a green vehicle routing problem (2018)
  20. Kozanidis, George: Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft (2018)

1 2 3 4 5 6 next