Combinatorial auctions knapsack problems von pfeiffer jella (23 Ergebnisse)

Zustand: New.

Paperback or Softback. Zustand: New. Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods. Book.

Paperback. Zustand: New.

Zustand: New.

Paperback. Zustand: New.

Zustand: New. In English.

Zustand: New.

Zustand: New.

Einband - flex.(Paperback). Zustand: New.

Taschenbuch. Zustand: Neu. Neuware - With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.…

Paperback. Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: As New. Unread book in perfect condition.

PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems. 128 pp. Englisch.…

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Pfeiffer JellaDipl.-Wirtschaftsinformatikerin, studied Computer Science and Business Administration at the University of Mannheim. Currently, she works as PhD student at the University of Mainz for the Department of Information Syste.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.…

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Revision with unchanged content. With the rapid diffusion of the internet, different kinds of market designs for e-commerce have emerged. Among these, combinatorial auctions (CAs) have gained increased interest as they permit bidders to express their valuations more easily. For applying a CA in real world scenarios, fast algorithms are needed to compute the optimal allocation of the offered goods. Although much research has dealt with this so-called Winner Determination Problem (WDP), only recently has its equivalence to the well-studied multi-dimensional knapsack problem (MDKP) been noticed. Therefore, there is a lack of research which compares approaches for solving MDKP and WDP problems. With this work, the author, Jella Pfeiffer, provides the missing integrative step, aiming at a more intense understanding and a mutual inspiration of both research areas. She examines structural differences of test instances from both domains, compares the performance of different algorithms, and alludes to a successful search behavior of non-exact but fast algorithms. The book addresses readers interested in electronic market design and algorithms solving complex combinatorial optimization problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch.…

Taschenbuch. Zustand: Neu. Combinatorial Auctions and Knapsack Problems | An analysis of optimization methods | Jella Pfeiffer | Taschenbuch | 128 S. | Englisch | 2012 | AV Akademikerverlag | EAN 9783639428711 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu Print on Demand.…