Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Hardcover. Condition: new.
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: SecondSale, Montgomery, IL, U.S.A.
Book
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
Published by Kluwer Academic Publishers, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: BookOrders, Russell, IA, U.S.A.
Book
Hard Cover. Condition: Good. No Jacket. Ex-library with the usual features. The interior is clean and tight. Binding is good. Cover shows light wear. 152 pages. Ex-Library.
Published by Springer, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Springer, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer US, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: moluna, Greven, Germany
Book Print on Demand
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the lates.
Published by Springer US, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the lates.
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Book Print on Demand
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Book Print on Demand
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Published by Springer US, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.
Published by Springer US, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling.
Published by Springer, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Hardcover. Condition: Like New. Like New. book.
Published by Springer US Okt 2012, 2012
ISBN 10: 1461352495ISBN 13: 9781461352495
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling. 180 pp. Englisch.
Published by Springer US Jan 2002, 2002
ISBN 10: 0792374606ISBN 13: 9780792374602
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems addresses two increasingly important areas in GA implementation and practice. OmeGA, or the ordering messy genetic algorithm, combines some of the latest in competent GA technology to solve scheduling and other permutation problems. Competent GAs are those designed for principled solutions of hard problems, quickly, reliably, and accurately. Permutation and scheduling problems are difficult combinatorial optimization problems with commercial import across a variety of industries. This book approaches both subjects systematically and clearly. The first part of the book presents the clearest description of messy GAs written to date along with an innovative adaptation of the method to ordering problems. The second part of the book investigates the algorithm on boundedly difficult test functions, showing principled scale up as problems become harder and longer. Finally, the book applies the algorithm to a test function drawn from the literature of scheduling. 178 pp. Englisch.