Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Winkler (1974)
Basis Factorization for Block-Angular Linear Problems: Unified Theory of Partitioning and Decomposition using the Simplex Method
John Forrest, J. Hirst, J. Tomlin (1974)
Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 20
G. Ross, R. Soland (1975)
A branch and bound algorithm for the generalized assignment problemMathematical Programming, 8
A. Charnes, F. Glover, David Karney, D. Klingman, J. Stutz (1973)
Past, Present and Future of Development, Computational Efficiency, and Practical Use of Large Scale Transportation and Transhipment Computer Codes
H. Williams (1974)
Experiments in the formulation of integer programming problems
Gary Roodman (1972)
Postoptimality analysis in zero‐one programming by implicit enumerationNaval Research Logistics Quarterly, 19
(1973)
Improving the ei~cietacy of Benders' decomposition algorithm for a special problem in transportation
M. Fisher, W. Northup, J. Shapiro (1975)
USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE*
E. Beale, J. Tomlin (1972)
An integer programming approach to a class of combinatorial problemsMathematical Programming, 3
J. Tomlin (1972)
Survey of computational methods for solving large scale systems, 11
G. Graves, R. Mcbride (1976)
The factorization approach to large-scale linear programmingMathematical Programming, 10
R. Goncharsky, A. Rauch, W. White (1974)
Large scale mathematical programming in an APL environment
(1974)
Alternative relaxation schemes for Benders' partitioning approach to mixed integer programming
(1975)
A comparison of storage structures for primal network codes. Paper presented at the ORSA/TIMS National Meeting, Chicago, May
(1973)
Some modeling principles for M.I.P.'s. Paper presented at the VIII International Symposium on Mathematical Programming
David Karney, D. Klingman (1976)
Implementation and Computational Study on an In-Core, Out-of-Core Primal Network CodeOper. Res., 24
G. Mitra (1973)
Investigation of some branch and bound strategies for the solution of mixed integer linear programsMathematical Programming, 4
(1975)
Developing and testing a truly large-scale network optimization code. Paper presented at the ORSA/TIMS National Meeting
(1973)
The use of inherent triangularity in network problems. Paper presented at the 44th National Meeting of ORSA
R. Armstrong, Prabhakant Sinha (1974)
Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion SizeManagement Science, 21
A. Geoffrion, G. Graves (1974)
Multicommodity Distribution System Design by Benders DecompositionManagement Science, 20
C. Piper, A. Zoltners (1975)
Implicit enumeration based algorithms for postoptimizing zero‐one programsNaval Research Logistics Quarterly, 22
(1973)
Improving the Efficiency of Benders' Decomposition Algorithm for a Special Problem in Transportation
(1975)
A comparison of storage structures for primal network codes. Paper presented at the ORSA/TIMS National Meeting
With a little care, a number of cutting-plane algorithms also lend themselves to reoptimization, although no computational experience has yet been reported
(1972)
Computational experience with the Ophelie mixed integer code
(1973)
Combining two integer programming algorithms
(1973)
Optimal investment planning for electric power generation
R. Breu, C. Burdet (1974)
Branch and bound experiments in zero-one programming
W. White (1973)
A Status Report on Computing Algorithms for Mathematical ProgrammingACM Comput. Surv., 5
F. Glover, David Karney, D. Klingman, A. Napier (1974)
A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation ProblemsManagement Science, 20
M. Grigoriadis (1974)
APOSS: a partial order in the solution space of bivalent programs
(1974)
Parametric integer programming PhD Dissertation, Graduate School of Management
Gary Roodman (1974)
Postoptimality analysis in integer programming by implicit enumeration: The mixed integer caseNaval Research Logistics Quarterly, 21
F. Glover (1975)
IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMSManagement Science, 22
E. Beale, John Forrest (1976)
Global optimization using special ordered setsMathematical Programming, 10
(1974)
Implicit enumeration: a computational study. Working Paper No
A. Geoffrion, R. Marsten (1972)
Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 18
Larry Austin, W. Hogan (1976)
Optimizing the Procurement of Aviation FuelsManagement Science, 22
M. Radke (1975)
Sensitivity Analysis in Discrete Optimization
A. Geoffrion, G. Graves (1976)
Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP ApproachOper. Res., 24
M. Fisher (1976)
A dual algorithm for the one-machine scheduling problemMathematical Programming, 11
(1974)
SESAME : design and capabilities overview. Document D0075
(1972)
The capacitated facility location problem with additional constraints. Paper presented at the Joint National Meeting of AIIE
The field of integer programming has been an extremely active one in recent years. Only a small fraction of the contributions, however, are of demonstrable practical value to practitioners or software designers within the near future. These are the contributions which these notes will attempt to survey. The selections are made on a subjective basis from the published and unpublished literature appearing over the last two years. The reader is cordially invited to express his opinions concerning my sins of omission and commission.
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Nov 1, 1974
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.