Improved integral simplex using decomposition for the set partitioning problem
Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each iteration. At each iteration, the method decom...
Guardado en:
Autores principales: | Abdelouahab Zaghrouti, Issmail El Hallaoui, François Soumis |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/70369344f7704cafbe00834a504a623c |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
An exact approach for the multi-constraint graph partitioning problem
por: Diego Recalde, et al.
Publicado: (2020) -
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017) -
Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013)