Two-row and two-column mixed-integer presolve using hashing-based pairing methods
In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase. Despite their mathematical simplicity, these methods can have significant impact on t...
Guardado en:
Autores principales: | Patrick Gemander, Wei-Kun Chen, Dieter Weninger, Leona Gottwald, Ambros Gleixner, Alexander Martin |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2020
|
Materias: | |
Acceso en línea: | https://doaj.org/article/87aae383cabe4346ba569049661df2fd |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A branch-and-cut algorithm for the target visitation problem
por: Achim Hildenbrandt
Publicado: (2019) -
An exact approach for the multi-constraint graph partitioning problem
por: Diego Recalde, et al.
Publicado: (2020) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020) -
Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017)