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

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

1 2 3 4 5 6 next

  1. Bektaş, Tolga; Gouveia, Luis; Martínez-Sykora, Antonio; Salazar-González, Juan-José: Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (2019)
  2. Letchford, Adam N.; Salazar-González, Juan-José: The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (2019)
  3. 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)
  4. Dalmeijer, Kevin; Spliet, Remy: A branch-and-cut algorithm for the time window assignment vehicle routing problem (2018)
  5. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  6. de Oliveira da Costa, Paulo Roberto; Mauceri, Stefano; Carroll, Paula; Pallonetto, Fabiano: A genetic algorithm for a green vehicle routing problem (2018)
  7. Kozanidis, George: Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft (2018)
  8. Lahyani, Rahma; Coelho, Leandro C.; Renaud, Jacques: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (2018)
  9. Liu, Tian; Luo, Zhixing; Qin, Hu; Lim, Andrew: A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (2018)
  10. Özener, Okan Örsan; Ekici, Ali: Managing platelet supply through improved routing of blood collection vehicles (2018)
  11. Boschetti, Marco Antonio; Maniezzo, Vittorio; Strappaveccia, Francesco: Route relaxations on GPU for vehicle routing problems (2017)
  12. Côté, J. F.; Guastaroba, G.; Speranza, M. G.: The value of integrating loading and routing (2017)
  13. 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)
  14. Larrain, Homero; Coelho, Leandro C.; Cataldo, Alejandro: A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (2017)
  15. Leggieri, Valeria; Haouari, Mohamed: Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (2017)
  16. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2017)
  17. Uchoa, Eduardo; Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Vidal, Thibaut; Subramanian, Anand: New benchmark instances for the capacitated vehicle routing problem (2017)
  18. Yu, Miao; Nagarajan, Viswanath; Shen, Siqian: Minimum makespan vehicle routing problem with compatibility constraints (2017)
  19. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  20. Subramanyam, Anirudh; Gounaris, Chrysanthos E.: A branch-and-cut framework for the consistent traveling salesman problem (2016)

1 2 3 4 5 6 next