Random restricted matching and lower bounds for combinatorial optimization
Year of publication: |
2012
|
---|---|
Authors: | Steinerberger, Stefan |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 24.2012, 3, p. 280-298
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Matching |
-
Levin, Asaf, (2016)
-
Integer programming formulations and benders decomposition for the maximum induced matching problem
Ahat, Betül, (2018)
-
The three-dimensional matching problem in Kalmanson matrices
Polyakovskiy, Sergey, (2013)
- More ...
-
The impossibility of rational consumer choice
Kapeller, Jakob, (2013)
-
Modeling the evolution of preferences: an answer to Schubert and Cordes
KAPELLER, JAKOB, (2014)
-
How formalism shapes perception: an experiment on mathematics as a language
Kapeller, Jakob, (2013)
- More ...