Narrow search
Showing 1 - 10 of 123
Cover Image
Preprint / Otto-von-Guericke-Universität Magdeburg, Fakultät für Wirtschaftswissenschaft
Universität <Magdeburg> / Fakultät für … - Magdeburg
Persistent link: https://www.econbiz.de/10004248827
Cover Image
Working paper series / Otto von Guericke University Magdeburg, Faculty of Economics and Management
Universität <Magdeburg> / Fakultät für … - Magdeburg : FEMM
Persistent link: https://www.econbiz.de/10004580996
Cover Image
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm
Borgwardt, Karl Heinz; Huhn, Petra - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 175-210
In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type:<Equation ID="Equ1"> <EquationSource Format="TEX"/> </Equation> We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a <Subscript>1</Subscript>,…,a <Subscript>m</Subscript>, v be distributed independently,...</subscript></subscript></equation>
Persistent link: https://www.econbiz.de/10010999590
Cover Image
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm
Borgwardt, Karl Heinz; Huhn, Petra - In: Mathematical methods of operations research 49 (1999) 2, pp. 175-210
Persistent link: https://www.econbiz.de/10006627418
Cover Image
Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection of Two-Dimensional Planes
Borgwardt, Karl Heinz - In: Mathematics of operations research 24 (1999) 4, pp. 925
Persistent link: https://www.econbiz.de/10006419385
Cover Image
A Sharper Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
Borgwardt, Karl Heinz - In: Mathematics of operations research 24 (1999) 3, pp. 544-603
Persistent link: https://www.econbiz.de/10006419504
Cover Image
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm
Borgwardt, Karl Heinz; Huhn, Petra - In: Computational Statistics 49 (1999) 2, pp. 175-210
In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type: We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a 1 ,…,a m , v be distributed independently,...
Persistent link: https://www.econbiz.de/10010759188
Cover Image
A cutting plane procedure for the travelling salesman problem on road networks
Fleischmann, Bernhard - In: European journal of operational research : EJOR 21 (1985) 3, pp. 307-317
Persistent link: https://www.econbiz.de/10003548912
Cover Image
Logistik: Aufgaben der Tourenplanung
Scholl, Armin; Klein, Robert; Domschke, Wolfgang; … - Fachbereich Rechts- und Wirtschaftswissenschaften, … - 1998
Persistent link: https://www.econbiz.de/10008525027