Integer Programming: Methods, Uses, Computations
AbstractThis paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Included are descriptions of general algorithms for solving linear programs in integers, as well as some special purpose algorithms for use on highly structured problems. This reflects a belief, on the author's part, that various clever methods of enumeration and other specialized approaches are the most efficacious means existent by which to obtain solutions to practical problems. A serious try at gathering computational experience has been made--but facts are difficult to uncover. The paper is written with intent to enable readers to read selected sections without having to read the whole.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 12 (1965)
Issue (Month): 3 (November)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Heinrich H. Nax & Bary S. R. Pradelski & H. Peyton Young, 2013. "The Evolution of Core Stability in Decentralized Matching Markets," Working Papers 2013.50, Fondazione Eni Enrico Mattei.
- Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.
- ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
- Snyder, Lawrence V. & Daskin, Mark S. & Teo, Chung-Piaw, 2007. "The stochastic location model with risk pooling," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1221-1238, June.
- Peter Biro & Walter Kern & Daniel Paulusma, 2011.
"Computing Solutions for Matching Games,"
IEHAS Discussion Papers
1142, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.
- Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," IEHAS Discussion Papers 1234, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.