Narrow search
Showing 1 - 10 of 24
Cover Image
A recipe for semidefinite relaxation for (0,1)-quadratic programming : in memory of Svata Poljak
Poljak, Svatopluk - In: Journal of global optimization : an international … 7 (1995) 1, pp. 51-73
Persistent link: https://www.econbiz.de/10001183956
Cover Image
Using a factored dual in augmented Lagrangian methods for semidefinite programming
De Santis, Marianna; Rendl, Franz; Wiegele, Angelika - In: Operations research letters 46 (2018) 5, pp. 523-528
Persistent link: https://www.econbiz.de/10011936691
Cover Image
A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph optimization problems
Adams, Elspeth; Anjos, Miguel F.; Rendl, Franz; … - In: INFOR : information systems and operational research 53 (2015) 1, pp. 40-48
Persistent link: https://www.econbiz.de/10011494570
Cover Image
Semidefinite programs and association schemes
Goemans, Michel X.; Rendl, Franz - 1999
Persistent link: https://www.econbiz.de/10001438286
Cover Image
Semidefinite relaxations for partitioning, assignment and ordering problems
Rendl, Franz - In: 4OR : a quarterly journal of operations research 10 (2012) 4, pp. 321-346
Persistent link: https://www.econbiz.de/10009679522
Cover Image
Lower bounds for the bandwidth problem
Rendl, Franz; Sotirov, Renata; Truden, Christian - In: Computers & operations research : and their … 135 (2021), pp. 1-9
Persistent link: https://www.econbiz.de/10012649704
Cover Image
Order picking : a survey of planning problems and methods
Wäscher, Gerhard - 2002
Persistent link: https://www.econbiz.de/10001711709
Cover Image
Order picking: a survey of planning problems and methods
Wäscher, Gerhard - In: Supply chain management and reverse logistics, (pp. 323-347). 2004
Persistent link: https://www.econbiz.de/10001828829
Cover Image
A new lower bound for the bin-packing problem and its integration into MTP
Schwerin, Petra - 1998
Persistent link: https://www.econbiz.de/10000993403