Congruency-constrained TU problems beyond the bimodular case
Year of publication: |
2024
|
---|---|
Authors: | Nägele, Martin ; Santiago, Richard ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 3, p. 1303-1348
|
Subject: | combinatorial optimization | integer programming | bounded subdeterminants | congruency constraints | total unimodularity | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
- More ...
-
Refuting a conjecture of Goemans on bounded degree spanning trees
Chestnut, Stephen, (2016)
-
A 2-approximation for the maximum satisfying bisection problem
Ries, Bernard, (2011)
-
Stochastic convergence of random search methods to fixed size Pareto front approximations
Laumanns, Marco, (2011)
- More ...