Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Used car salesman problem: A differential auction–barter market

Used car salesman problem: A differential auction–barter market We define a problem called “used car salesman problem” in which sale, purchase and barter bids can be simultaneously put forward for trading cars. A sale or a purchase bid is expressed in terms of a single car and a sale or purchase price that is required for the car. A barter bid, on the other hand, can be augmented by a differential money amount that is offered or required in addition to the cars that are to be traded. Restrictions are also allowed to be placed on sale and purchase bids. A minimum cost circulation network flow algorithm is presented which produces a solution that maximizes the profit made by the used car salesman. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Used car salesman problem: A differential auction–barter market

Loading next page...
 
/lp/springer-journals/used-car-salesman-problem-a-differential-auction-barter-market-djWqSN9DH2

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-005-4691-z
Publisher site
See Article on Publisher Site

Abstract

We define a problem called “used car salesman problem” in which sale, purchase and barter bids can be simultaneously put forward for trading cars. A sale or a purchase bid is expressed in terms of a single car and a sale or purchase price that is required for the car. A barter bid, on the other hand, can be augmented by a differential money amount that is offered or required in addition to the cars that are to be traded. Restrictions are also allowed to be placed on sale and purchase bids. A minimum cost circulation network flow algorithm is presented which produces a solution that maximizes the profit made by the used car salesman.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Mar 30, 2005

There are no references for this article.