Integer Programming by Implicit Enumeration and Balas’ Method
Arthur M. Geoffrion · SIAM Review · 1967
Previous article Next article Integer Programming by Implicit Enumeration and Balas’ MethodArthur M. GeoffrionArthur M. Geoffrionhttps://doi.org/10.1137/1009031PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Egon Balas, An additive algorithm for solving linear programs with zero-one variables, Operations Res., 13 (1965), 517–546 MR0183535 0194.19903 CrossrefISIGoogle Scholar[2] M. L. Balinski, Integer programming: Methods, uses, computation, Management Sci., 12 (1965), 253–313 MR0192924 0129.12004 CrossrefISIGoogle Scholar[3] S. I. Firstman, An approximating algorithm for an optimum aim-points problem, Naval Res. Logist. Quart., 7 (1960), 151–167 CrossrefGoogle Scholar[4] R. J. Freeman, Computational experience with the Balas integer programming algorithm, P-3241, The RAND Corporation, Santa Monica, California, 1965 Google Scholar[5] F. Glover, A multiphase-dual algorithm for the zero-one integer programming problem, Operations Res., 13 (1965), 879–919 0163.41301 CrossrefISIGoogle Scholar[6] Frank Proschan and , T. A. Bray, Optimum redundancy under multiple constraints, Operations Res., 13 (1965), 800–814 MR0187914 CrossrefISIGoogle Scholar[7] R. J. Walker, R. Bellman and , M. Hall, Jr., An enumerative technique for a class of combinatorial problemsProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 91–94, Combinatorial Analysis MR0121306 0096.00603 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Machine learning-based optimal design of groundwater pollution monitoring networkEnvironmental Research, Vol. 211 Cross Ref Some new perspectives for solving 0–1 integer programming problems using Balas method11 March 2021 | Computational Management Science, Vol. 18, No. 2 Cross Ref An Optimal Sensor Deployment Technique for Spectrum Monitoring Applications Cross Ref Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesisParallel Computing, Vol. 101 Cross Ref Virtual Service Placement for Edge Computing Under Finite Memory and BandwidthIEEE Transactions on Communications, Vol. 68, No. 12 Cross Ref Optimum Selection of Mobile Edge Computing Hosts Based on Extended Balas-Geoffrion Additive Algorithm Cross Ref Integer based formulation for the simple assembly line balancing problem with multiple identical tasksComputers & Industrial Engineering, Vol. 104 Cross Ref Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem18 September 2012 | Annals of Operations Research, Vol. 222, No. 1 Cross Ref References22 August 2014 Cross Ref General Bibliography8 August 2014 Cross Ref Branch-and-Bound Methods8 August 2014 Cross Ref Global optimization of capacity expansion and flow assignment in multicommodity networks16 July 2013 | Pesquisa Operacional, Vol. 33, No. 2 Cross Ref Branch-and-Bound Methods21 January 2013 Cross Ref Recommendation systems with complex constraintsACM Transactions on Information Systems, Vol. 29, No. 4 Cross Ref A binary integer linear programming-based approach for solving the allocation problem in multiprocessor partitioned scheduling Cross Ref Optimizing data collection path in sensor networks with mobile elements18 February 2011 | International Journal of Automation and Computing, Vol. 8, No. 1 Cross Ref Optimizing the Path-Points Identification for Data Mules in Mobile WSNs Cross Ref Path-Planning with Avoidance Using Nonlinear Branch-and-Bound OptimizationJournal of Guidance, Control, and Dynamics, Vol. 32, No. 2 Cross Ref Genetic Algorithm Based Length Reduction of a Mobile BS Path in WSNs Cross Ref Reducing the Path Length of a Mobile BS in WSNs Cross Ref Comparison of Branching Strategies for Path-Planning with Avoidance Using Nonlinear Branch-and-Bound15 June 2012 Cross Ref A revised Taha's algorithm for polynomial 0-1 programmingOptimization, Vol. 56, No. 5-6 Cross Ref Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method16 January 2007 | Journal of Global Optimization, Vol. 39, No. 1 Cross Ref An Optimization Model to Determine Master Designs and Runs for Advertisement Printing24 May 2006 | Journal of Mathematical Modelling and Algorithms, Vol. 6, No. 2 Cross Ref New Implicit Enumeration Method for Polynomial 0-1 ProgrammingSystems Engineering - Theory & Practice, Vol. 27, No. 3 Cross Ref Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower boundsEuropean Journal of Operational Research, Vol. 168, No. 3 Cross Ref An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity ConsiderationsTransportation Science, Vol. 36, No. 4 Cross Ref Global Optimization Procedures for the Capacitated Euclidean and l p Distance Multifacility Location-Allocation ProblemsOperations Research, Vol. 50, No. 3 Cross Ref A two-phase linear programming approach for redundancy allocation problemsYugoslav Journal of Operations Research, Vol. 12, No. 2 Cross Ref Calculating uncertainty intervals in approximate equation systemsApplied Numerical Mathematics, Vol. 27, No. 1 Cross Ref DISCRETE STRUCTURAL OPTIMIZATION WITH COMMERCIALLY AVAILABLE SECTIONSDoboku Gakkai Ronbunshu, Vol. 1996, No. 549 Cross Ref Three-dimensional pattern matching in protein structure analysis31 May 2005 Cross Ref Multi-item capacitated lot-sizing by a Cross decomposition based algorithmAnnals of Operations Research, Vol. 50, No. 1 Cross Ref A zero-one implicit enumeration method for optimizing investments in transmission expansion planningIEEE Transactions on Power Systems, Vol. 9, No. 3 Cross Ref A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problemDiscrete Applied Mathematics, Vol. 49, No. 1-3 Cross Ref A squared-euclidean distance location-allocation problemNaval Research Logistics, Vol. 39, No. 4 Cr
Cited by 224 works. doi:10.1137/1009031
Authors
References
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming: Methods, Uses, Computations
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Optimum Redundancy Under Multiple Constraints
- An enumerative technique for a class of combinatorial problems
- An approximating algorithm for an optimum aim-points problem