A Combinational Auction Improves School Meals in Chile

References

• Baird F. T. A feasibility study of procedures to solve the tender acceptance and payout problem in the allocation/reduction of fish catches. (1984) . Report for the New Zealand Fishing Industry Board, PHB Hagler BaillyGoogle Scholar
• Balakrishnan A., Magnanti T. L., Wong R. T. A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. (1989) 37(5):716–740Link, Google Scholar
• Crowder H. P., Johnson E. L., Padberg M. W. Solving large scale 0–1 linear programming problems. Oper. Res. (1983) 31(5):803–834Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Henríquez L. JUNAEB., national support to students. (1999) Paper presented at the South America Conference on School Nourishment, Medellin, ColombiaGoogle Scholar
• Kelly F., Steinberg R. A combinatorial auction with multiple winners for universal service. Management Sci. (2000) 46(4):586–596Link, Google Scholar
• Keskinocak P., Tayur S. Quantitative analysis for Internet-enabled supply chains. Interfaces (2000) 31(2):70–89Link, Google Scholar
• Klemperer P. Auction theory: A guide to the literature. J. Econom. Surveys (1999) 13(3):227–286Crossref, Google Scholar
• Letchford A. N. Allocation of school bus contracts by integer programming. J. Oper. Res. Society (1996) 47(3):369–372Crossref, Google Scholar
• Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Rothkopf M. H., Pekec A., Harstad R. M. Computationally manageable combinational auctions. Management Sci. (1998) 44(8):1131–1147Link, Google Scholar