On the lattice programming gap of the group problems
Year of publication: |
2015
|
---|---|
Authors: | Aliev, Iskander |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 2, p. 199-202
|
Subject: | Group relaxations | Integer programming gap | Lattices | Diameters of graphs | Covering radius | Frobenius numbers | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming |
-
Maximizing engagement in large-scale social networks
Kroger, Samuel, (2024)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
A minmax regret version of the time-dependent shortest path problem
Conde, Eduardo, (2018)
- More ...
-
Integer Knapsacks: Average Behavior of the Frobenius Numbers
Aliev, Iskander, (2009)
-
LLL-reduction for integer knapsacks
Aliev, Iskander, (2012)
-
Integer knapsacks : average behavior of the Frobenius numbers
Aliev, Iskander, (2009)
- More ...