Constraint relaxation for the discrete ordered median problem
Year of publication: |
2023
|
---|---|
Authors: | Martínez-Merino, Luisa I. ; Ponce, Diego ; Puerto, Justo |
Published in: |
Top : an official journal of the Spanish Society of Statistics and Operations Research. - Berlin : Springer, ISSN 1863-8279, ZDB-ID 2322573-7. - Vol. 31.2023, 3, p. 538-561
|
Subject: | Branch-and-cut | Constraint relaxation | Discrete ordered median problem | Row generation |
-
A new combinatorial algorithm for separable convex resource allocation with nested bound constraints
Wu, Zeyang, (2021)
-
Average Relaxations of Extremal Problems
Tsirlin, Anatoliy M., (2003)
-
A modified variable neighborhood search for the discrete ordered median problem
Puerto, Justo, (2014)
- More ...
-
Network flow based approaches for the pipelines routing problem in naval design
Blanco, Víctor, (2022)
-
A branch-and-price procedure for clustering data that are graph connected
Benati, Stefano, (2022)
-
On the multisource hyperplanes location problem to fitting set of points
Blanco, Víctor, (2021)
- More ...