Narrow search
Showing 1 - 10 of 2,252
Cover Image
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem
Bierwirth, Christian; Mattfeld, Dirk Christian; Watson, … - 2004
TWe perform a novel analysis of the fitness landscape of thejob-shop scheduling problem (JSP). In contrast to other well-known combinatorial optimization problems, we show that the landscape of the JSP is non-regular, in that the connectivity of solutions is variable.
Persistent link: https://www.econbiz.de/10005847540
Cover Image
A polynomial algorithm for the max cut problem on graphs without long odd cycles
Grötschel, Martin; Nemhauser, George L. - 1982
Persistent link: https://www.econbiz.de/10000420033
Cover Image
A simple algorithm for a class of quadratic smoothing problems
Morton, George; Ringwald, Karl; Randow, Rabe von - 1982
Persistent link: https://www.econbiz.de/10000421213
Cover Image
Theory of matrix algorithms
Brucker, Peter - 1974
Persistent link: https://www.econbiz.de/10000053105
Cover Image
A deep cut ellipsoid algorithm for convex programming : theory and applications
Frenk, J. B.; Gromicho, J.; Zhang, Shuzhong - 1994
Persistent link: https://www.econbiz.de/10000122428
Cover Image
An O (nL) iteration bound primal-dual cone affine scaling algorithm
Sturm, Jos F.; Zhang, Shuzhong - 1993
Persistent link: https://www.econbiz.de/10000122530
Cover Image
Fundamental algorithms
Knuth, Donald Ervin - 1973 - 2. ed
Persistent link: https://www.econbiz.de/10000099109
Cover Image
Seminumerical algorithms
Knuth, Donald Ervin - 1969
Persistent link: https://www.econbiz.de/10000099110
Cover Image
A survey of mathematical optimization models and algorithms for designing and extending irrigation and wastewater networks
Mandl, Christoph E. - 1980
Persistent link: https://www.econbiz.de/10000040510
Cover Image
A hybrid algorithm for solving convex separable network flow problems
Belling-Seib, Katharina - 1983
Persistent link: https://www.econbiz.de/10000021173