Integer and combinatorial optimization
Integer and combinatorial optimization
Computationally Manageable Combinational Auctions
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Combinatorial Auction with Multiple Winners for Universal Service
Management Science
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Simulating combinatorial auctions with dominance requirement and loll bids through automated agents
Decision Support Systems
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
Solving multiple scenarios in a combinatorial auction
Computers and Operations Research
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions
INFORMS Journal on Computing
Super solutions for combinatorial auctions
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
A mechanism for supporting collective innovation: the open contract-based challenge
Information Systems and e-Business Management
| Hi-index | 0.00 |
Chile's school system is using mathematical modeling to assign catering contracts in a singleround sealed-bid combinational auction. The Chilean state spends around US$180 million a year to feed 1,300,000 students from low income families, making this one of the largest state auctions. To improve the quality of the assignment in the auction process, we constructed an integer linear programming model to decide contract awards optimally among different concession holders. The model completely changed the nature of the process in three crucial aspects. First, it gave transparency and objectivity to the complete process, generating competition among firms. Second, it allowed the companies to build flexible territorial bids to include their scale economies, leading to efficient resource allocation. Finally, the model indeed found an optimal solution, which is not easy because the assignment problem was NP-complete with more than 10,000 binary variables. This new methodology improved the price-quality ratio of the meals with yearly savings of around US$40 million--equivalent to the cost of feeding 300,000 children during one year.