Order Total (1 Item Items):
Shipping Destination:
Combinatorial Auctions Knapsack Problems by Pfeiffer Jella (21 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (21)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (19)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (21)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (13)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Condition: New.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Condition: New.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Condition: New. SUPER FAST SHIPPING.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Condition: New.
-
Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Condition: As New. Unread book in perfect condition.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 38.47
Convert currency£ 11.98 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller e.K. 2007-12-20, 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
£ 37.58
Convert currency£ 15.49 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 38.46
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 44.77
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods (Paperback or Softback)
Published by VDM Verlag Dr. Mueller E.K. 12/20/2007, 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Paperback or Softback. Condition: New. Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods 0.48. Book.
-
Condition: New.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
£ 46.51
Convert currency£ 42.78 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Combinatorial Auctions and Knapsack Problems : An Analysis of Optimization Methods
Published by VDM Verlag Dr. Müller Jan 2008, 2008
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
£ 56.22
Convert currency£ 53.36 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
Combinatorial Auctions and Knapsack Problems - An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Combinatorial Auctions and Knapsack Problems An Analysis of Optimization Methods
Published by VDM Verlag Dr. Mueller E.K., 2007
ISBN 10: 3836450062 ISBN 13: 9783836450065
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
£ 41.81
Convert currency£ 4.16 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Combinatorial Auctions and Knapsack Problems
Published by AV Akademikerverlag Jun 2012, 2012
ISBN 10: 3639428714 ISBN 13: 9783639428711
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
£ 53.06
Convert currency£ 20.08 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
£ 70.90
Convert currency£ 6.50 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand.
-
Condition: New. PRINT ON DEMAND.
-
£ 41.66
Convert currency£ 42.78 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
-
Combinatorial Auctions and Knapsack Problems
Published by AV Akademikerverlag Jun 2012, 2012
ISBN 10: 3639428714 ISBN 13: 9783639428711
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
£ 53.06
Convert currency£ 52.39 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: 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.
-
£ 53.06
Convert currency£ 53.31 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: 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.
