Integer Programming Algorithms: A Framework and State-of-the-Art Survey

A. M. Geoffrion
A. M. Geoffrion
University of California, Los Angeles
Search for more papers by this author
,
R. E. Marsten
R. E. Marsten
University of California, Los Angeles
Search for more papers by this author

A. M. Geoffrion

University of California, Los Angeles

Search for more papers by this author

R. E. Marsten

University of California, Los Angeles

Search for more papers by this author

Published Online:1 May 1972https://doi.org/10.1287/mnsc.18.9.465

Abstract

A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this framework, and prospects for future progress are assessed.

Cited by
- Multi-scale reinforcement learning framework for development policy optimization: Evidence from energy poverty alleviation
  Renewable and Sustainable Energy Reviews, Vol. 226
- A seminal contribution of Ailsa Land and Alison Doig Harcourt to the field of mathematical programming
  5 March 2025 | Australian & New Zealand Journal of Statistics, Vol. 67, No. 4
- Multi-Agent Tsallis Actor–Critic for Autonomous Vehicle Fleet Coordination on Road Graph Networks
- AdaGuiDE: An adaptive and guided differential evolution for continuous optimization problems
  31 August 2024 | Applied Intelligence, Vol. 54, No. 21
- A surrogate-based heuristic for production planning problem of orders in small foundries
  Computers & Operations Research, Vol. 164
- Forest Burned Area Detection Using a Novel Spectral Index Based on Multi-Objective Optimization
  28 October 2022 | Forests, Vol. 13, No. 11
- Maximum Profit of Real-Time IoT Content Retrieval by Joint Content Placement and Storage Allocation in C-RANs
  IEEE Transactions on Cloud Computing, Vol. 10, No. 4
- A method for convex black-box integer global optimization
  27 February 2021 | Journal of Global Optimization, Vol. 80, No. 2
- Time Synchronization Attack and Countermeasure for Multisystem Scheduling in Remote Estimation
  IEEE Transactions on Automatic Control, Vol. 66, No. 2
- Profit-Based Algorithm of Joint Real-Time Task Scheduling and Resource Allocation in C-RANs
  IEEE Internet of Things Journal, Vol. 8, No. 2
- Rounding Algorithm of Minimizing Executing and Transmitting Time in Multiple CRANs
  IEEE Access, Vol. 9
- A Light-Weight Approach to Software Assignment at the Edge
- Content placement for minimizing transmission cost in multiple cloud radio access networks
  Computer Networks, Vol. 181
- References
  19 September 2020
- Minimizing executing and transmitting time of task scheduling and resource allocation in C-RANs
  Future Generation Computer Systems, Vol. 108
- Approximation Algorithms of Minimizing Hidden Pairs in 802.11ah Networks
  IEEE Access, Vol. 7
- Extended omega ratio optimization for risk‐averse investors
  12 June 2015 | International Transactions in Operational Research, Vol. 24, No. 3
- A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach
  1 March 2017 | International Journal of Mathematical, Engineering and Management Sciences, Vol. 2, No. 1
- Time-Based Toll Design for a Cordon-Based Congestion Pricing Scheme for a Transportation Network with Speed Limits and Movement Prohibitions
  Journal of Transportation Engineering, Vol. 140, No. 6
- Investigation of a Joint Venture-Ship between Two Firms in Ghana Using Linear Programming
  27 September 2013 | Advanced Materials Research, Vol. 824
- A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems
  7 January 2013 | Networks, Vol. 62, No. 1
- Joint Base Station Association and Power Control via Benders' Decomposition
  IEEE Transactions on Wireless Communications, Vol. 12, No. 4
- Application of Integer Linear Programming to an Investment Problem of a Firm in Ghana
  1 December 2012 | International Journal of Engineering Research in Africa, Vol. 8
- A GA-based approach for optimizing single-part flow-line configurations of RMS
  4 August 2009 | Journal of Intelligent Manufacturing, Vol. 22, No. 2
- Efficient cross-layer protocol for bandwidth-satisfied multicast in multi-rate MANETs
  19 December 2010 | Wireless Networks, Vol. 17, No. 3
- Golf course revenue management
  6 November 2009 | Journal of Revenue and Pricing Management, Vol. 10, No. 2
- Lagrangian Optimization for LP : Theory and Algorithms
  15 September 2015
- Lagrangian Optimization for LP
  15 February 2011
- Golf Course Revenue Management
- Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations
  13 December 2010 | Journal of Physics: Conference Series, Vol. 256
- Improved branch and bound algorithm with a comparison between different LP solvers
- A branch and bound algorithm for determining locations of long-term care facilities
  European Journal of Operational Research, Vol. 206, No. 1
- Bandwidth-satisfied multicast trees in large-scale ad-hoc networks
  10 March 2009 | Wireless Networks, Vol. 16, No. 3
- Multicommodity Distribution System Design by Benders Decomposition * † ‡
  27 August 2010
- Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis
  1 January 2025 | Psychometrika, Vol. 74, No. 4
- An Exploratory Study for Identifying and Implementing Concerns in Integer Programming
- Bandwidth-Satisfied Multicast Trees in MANETs
  IEEE Transactions on Mobile Computing, Vol. 7, No. 6
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
  Computers & Operations Research, Vol. 34, No. 10
- A Stable Model-Based Fuzzy Predictive Control Based on Fuzzy Dynamic Programming
  IEEE Transactions on Fuzzy Systems, Vol. 15, No. 4
- Dynamic survivable routing for shared segment protection
  Journal of Communications and Networks, Vol. 9, No. 2
- Bandwidth-Satisfied Multicast Services in Large-Scale MANETs
- Modelo multi-estágio de otimização para o planejamento da expansão de sistemas de distribuição
  Sba: Controle & Automação Sociedade Brasileira de Automatica, Vol. 17, No. 4
- Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information
  European Journal of Operational Research, Vol. 174, No. 1
- Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds
  European Journal of Operational Research, Vol. 168, No. 3
- Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
  Annals of Operations Research, Vol. 139, No. 1
- The elastic generalized assignment problem
  21 December 2017 | Journal of the Operational Research Society, Vol. 55, No. 12
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
  Robert M. Nauss,
  1 August 2003 | INFORMS Journal on Computing, Vol. 15, No. 3
- Wavelength Routing and Assignment in a Survivable WDM Mesh Network
  Jeffery Kennington,
  Eli Olinick,
  Augustyn Ortynski,
  Gheorghe Spiride,
  1 February 2003 | Operations Research, Vol. 51, No. 1
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
  European Journal of Operational Research, Vol. 140, No. 3
- An accelerated Branch-and-Bound algorithm for assignment problems of utility systems
  Computers & Chemical Engineering, Vol. 26, No. 4-5
- MILP optimization of energy supply by using a boiler, a condensing turbine and a heat pump
  Energy Conversion and Management, Vol. 43, No. 4
- A Comparison of Optimal Methods for Local Access Uncapacitated Network Design
  Annals of Operations Research, Vol. 106, No. 1-4
- An accelerated branch-and-bound algorithm for assignment problems of utility systems
- Specialised branch-and-bound algorithm for transmission network expansion planning
  IEE Proceedings - Generation, Transmission and Distribution, Vol. 148, No. 5
- Branch and bound algorithm for transmission system expansion planning using a transportation model
  IEE Proceedings - Generation, Transmission and Distribution, Vol. 147, No. 3
- An implicit exhaustion method for solving some extremum problems on sets
  Journal of Mathematical Sciences, Vol. 97, No. 2
- A Computational Study of Search Strategies for Mixed Integer Programming
  J. T. Linderoth,
  M. W. P. Savelsbergh,
  1 May 1999 | INFORMS Journal on Computing, Vol. 11, No. 2
- A REVIEW OF RECENT ADVANCES IN GENERATOR MAINTENANCE SCHEDULING
  Electric Machines & Power Systems, Vol. 26, No. 4
- Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
- Discrete Optimization
- Solution approaches to hub location problems
  Annals of Operations Research, Vol. 78, No. 0
- Capital Budgeting Decisions With Fuzzy Projects
  The Engineering Economist, Vol. 43, No. 2
- A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem
  Computational Optimization and Applications, Vol. 8, No. 3
- A binary integer linear program with multi-criteria and multi-constraint levels
  Computers & Operations Research, Vol. 24, No. 3
- Solution Methods for Nonconvex Network Flow Problems
- Chemical plant layout via graph partitioning—II. Multiple levels
  Computers & Chemical Engineering, Vol. 20, No. 5
- Incumbent solutions in branch-and-bound algorithms: Setting the record straight
  Computers & Operations Research, Vol. 23, No. 5
- A coupled gradient network approach for static and temporal mixed-integer optimization
  IEEE Transactions on Neural Networks, Vol. 7, No. 3
- A multiple-tree search procedure for the resource-constrained project scheduling problem
  European Journal of Operational Research, Vol. 89, No. 3
- Global Optimization Problems in Computer Vision
- Computational comparison on the partitioning strategies in multiple choice integer programming
  European Journal of Operational Research, Vol. 88, No. 1
- A heuristic method for reactive power planning
  IEEE Transactions on Power Systems, Vol. 11, No. 1
- Nonconvex optimization over a polytope using generalized capacity improvement
  Journal of Global Optimization, Vol. 7, No. 2
- Groundwater Remediation Design Using a Three‐Dimensional Simulation Model and Mixed‐Integer Programming
  9 July 2010 | Water Resources Research, Vol. 31, No. 5
- Solution of the Machine Loading Problem with Binary Variables
- Optimization of mechanical assembly tolerances by incorporating Taguchi's quality loss function
  Journal of Manufacturing Systems, Vol. 14, No. 4
- Integer Programming
- Optimizing single-terminal dispatch of large volume trips to trucks
  Annals of Operations Research, Vol. 50, No. 1
- Methods for optimization of nonlinear problems with discrete variables: A review
  Structural Optimization, Vol. 8, No. 2-3
- Designing multi-hour hierarchical communications networks with fixed charge and piecewise linear costs
  Telecommunication Systems, Vol. 3, No. 2
- Optimal unit commitment in simulations of hydrothermal power systems: an augmented Lagrangian approach
  Simulation Practice and Theory, Vol. 1, No. 4
- Modeling uncertainty in networks
  Mathematical and Computer Modelling, Vol. 17, No. 8
- Scheduling a project to maximize its net present value: An integer programming approach
  European Journal of Operational Research, Vol. 64, No. 2
- A Comprehensive Review of Production Lot‐sizing
  International Journal of Physical Distribution & Logistics Management, Vol. 23, No. 1
- Circuit delay optimization as a multiple choice linear knapsack program
- Algorithms for robust single and multiple period layout planning for manufacturing systems
  European Journal of Operational Research, Vol. 63, No. 2
- Multiple choice programming
  15 July 1992 | ACM SIGAPL APL Quote Quad, Vol. 23, No. 1
- BATCHING DECISIONS IN A MULTI‐STAGED FOOD MANUFACTURING PROCESS
  30 January 2007 | Journal of Food Process Engineering, Vol. 15, No. 2
- Auswahl von theoriebezogenen Veröffentlichungen
- Composite stock cutting through simulated annealing
  Mathematical and Computer Modelling, Vol. 16, No. 1
- On the calculation of true and pseudo penalties in multiple choice integer programming
  European Journal of Operational Research, Vol. 55, No. 2
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
  Computers & Operations Research, Vol. 18, No. 2
- An algorithm for disjunctive programs
  European Journal of Operational Research, Vol. 48, No. 3
- Distribution Requirements Planning: A Generalised System for Delivery Scheduling in a Multi‐Sourcing Logistics System
  International Journal of Physical Distribution & Logistics Management, Vol. 20, No. 2
- A new method for discrete optimization problems
  11 September 2007 | Electronics and Communications in Japan (Part III: Fundamental Electronic Science), Vol. 73, No. 11
- An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
  Mathematical Programming, Vol. 46, No. 1-3
- A one-dimensional cutting stock problem in the aluminium industry and its solution
  European Journal of Operational Research, Vol. 44, No. 2
- The integer linear complementarity problem
  International Journal of Computer Mathematics, Vol. 31, No. 3-4
- Optimal planning of telecommunication networks with logical and physical aspects
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
  European Journal of Operational Research, Vol. 43, No. 3
- Synthesis of systolic algorithm design
  Parallel Computing, Vol. 12, No. 2
- Combining flow simulation and optimization for dynamic management of relief wells
  Advances in Water Resources, Vol. 12, No. 1
- Scheduling in a manufacturing shop with sequence-dependent setups
  Robotics and Computer-Integrated Manufacturing, Vol. 5, No. 1
- Chapter VI Integer programming
- On the use of internal rate of return in linear and integer programming
  Operations Research Letters, Vol. 7, No. 6
- Method of Programming Regional Highway Projects
  Journal of Transportation Engineering, Vol. 114, No. 5
- Ordering scheduling problem in manufacturing systems
  International Journal of Production Research, Vol. 26, No. 9
- References
  22 August 2014
- A randomized parallel branch-and-bound algorithm
  International Journal of Parallel Programming, Vol. 17, No. 3
- An approach to postoptimality and sensitivity analysis of zero-one goal programs
  Naval Research Logistics, Vol. 35, No. 1
- Models and methods of solution of quadratic integer programming problems
  Cybernetics, Vol. 23, No. 3
- Dynamic location problems with radial structure of the components of the connecting graph
  Cybernetics, Vol. 24, No. 2
- Forming the optimal union of multiple databases
  Information Systems, Vol. 13, No. 4
- References
- Linear complementarity problems solvable by integer programming
  Optimization, Vol. 19, No. 4
- Learning heuristic functions for numeric optimization problems
- Construction Grants Program: Capital Budgeting
  Journal of Environmental Engineering, Vol. 113, No. 4
- Combinatorial Search with Fuzzy Estimates
- Exact methods for the knapsack problem and its generalizations
  European Journal of Operational Research, Vol. 28, No. 1
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
  BIT, Vol. 26, No. 1
- The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
  Discrete Applied Mathematics, Vol. 13, No. 2-3
- A class of problems of optimal net synthesis
  Cybernetics, Vol. 21, No. 5
- Tailoring Benders decomposition for uncapacitated network design
  26 February 2009
- Optimal Allocation of Redundant Components for Large Systems
  IEEE Transactions on Reliability, Vol. R-34, No. 3
- Integer Programming
- Mixed-integer programming approach for the synthesis of integrated process flowsheets
  Computers & Chemical Engineering, Vol. 9, No. 5
- Postoptimality analysis for a network protocol feature specification model
  Computers & Industrial Engineering, Vol. 9, No. 4
- Solving capacitated clustering problems
  European Journal of Operational Research, Vol. 18, No. 3
- A Mathematical Programming Approach to Editing of Continuous Survey Data
  SIAM Journal on Scientific and Statistical Computing, Vol. 5, No. 4
- Cutting Plane and Branch and Bound for Solving a Class of Scheduling Problems
  6 July 2007 | IIE Transactions, Vol. 16, No. 1
- A branch-and-bound algorithm for the solution of two network scheduling problems
  Cybernetics, Vol. 20, No. 1
- An allocation problem in the design of a class of large-scale systems: Model and algorithm
- Three methods for postoptimal analysis in integer linear programming
  27 February 2009
- MATHEMATICAL PROGRAMMING
- SPARSITY DIRECTED MIXED INTEGER LINEAR PROGRAMMING APPLIED FOR SOLVING DISCRETE DECISION PROBLEMS IN ELECTRICAL POWER SYSTEMS
- Using branch-and-bound algorithms to obtain suboptimal solutions
  Zeitschrift für Operations Research, Vol. 27, No. 1
- Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs
  6 July 2007 | IIE Transactions, Vol. 15, No. 4
- The best parameter subset using the Chebychev curve fitting criterion
  Mathematical Programming, Vol. 27, No. 1
- Fuel Allocation in Processing Copper Ore
  6 July 2007 | IIE Transactions, Vol. 15, No. 3
- Head-and-shoulder-branching in integer programming
  1 April 1983 | ACM SIGMAP Bulletin, Vol. 28, No. 32
- Locational analysis
  European Journal of Operational Research, Vol. 12, No. 3
- The Isomorphism of Simple File Allocation
  IEEE Transactions on Computers, Vol. C-32, No. 3
- An empirical investigation of different strategies for material requirements planning
  12 April 2002 | Journal of Operations Management, Vol. 3, No. 2
- A structural optimization approach in process synthesis—I
  Computers & Chemical Engineering, Vol. 7, No. 6
- CAN AUTOMATIC DATA EDITING BE JUSTIFIED? ONE PERSON'S OPINION
- Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique
  29 March 2011 | RAIRO - Operations Research, Vol. 17, No. 3
- Mixed-integer quadratic programming
  Mathematical Programming, Vol. 22, No. 1
- Optimal file allocation in a computer network: a solution method based on the knapsack problem
  Computer Networks (1976), Vol. 6, No. 5
- Parametric integer linear programming: A synthesis of branch and bound with cutting planes
  European Journal of Operational Research, Vol. 10, No. 2
- Optimal offsets for traffic signal systems in urban networks
  Transportation Research Part B: Methodological, Vol. 16, No. 2
- On maintenance scheduling of production units
  European Journal of Operational Research, Vol. 9, No. 3
- Which Options Provide the Quickest Solutions
- Resolution of a quadratic combinatorial problem by dynamic programming
- A classroom/time assignment model
  European Journal of Operational Research, Vol. 9, No. 1
- A branch‐and‐bound algorithm for solving fixed charge problems
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 28, No. 4
- The user interface and performance of commercial mixed integer programming software
  OR Spektrum, Vol. 2, No. 4
- ECONOMIC BENEFITS OF COOPERATIVE POWER SUPPLY EXPANSION*
  28 July 2006 | Journal of Regional Science, Vol. 21, No. 3
- Traffic scheduling via Benders decomposition
  25 February 2009
- The contract formation problem in preventive pavement maintenance: A fixed-charge goal programming model
  Computers, Environment and Urban Systems, Vol. 6, No. 3
- A NOTE ON USER SOLUTION STRATEGY FOR MIXED‐INTEGER LINEAR PROGRAMMING MODELS
  7 June 2007 | Decision Sciences, Vol. 12, No. 1
- Optimal Design of Distributed Information Systems
  IEEE Transactions on Computers, Vol. C-29, No. 12
- Experiments in integer programming
  Discrete Applied Mathematics, Vol. 2, No. 1
- Implicit enumeration algorithms for the Set-Partitioning Problem
  3 May 2005 | Operations-Research-Spektrum, Vol. 2, No. 1
- Empirischer Leistungsvergleich kommerzieller Softwaresysteme APEX III, FMPS, MPSX-MIP/370 bei gemischt-ganzzahligen Optimierungsproblemen
- Applications of mixed-integer linear programming in process synthesis
  Computers & Chemical Engineering, Vol. 4, No. 4
- INTEGER PROGRAMMING
- A Problem of Assigning Suppliers to Plants
  A I I E Transactions, Vol. 11, No. 4
- Assignment Of Military Officers To Groups: A Multi-Attribute Team Balancing Problem
  25 May 2016 | INFOR: Information Systems and Operational Research, Vol. 17, No. 2
- Computational results with a branch‐and‐bound algorithm for the general knapsack problem
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 26, No. 1
- A set-covering problem: the combinatorial-local approach and the branch and bound method
  USSR Computational Mathematics and Mathematical Physics, Vol. 19, No. 6
- Capital budgeting problems in pavement maintenance
  Urban Systems, Vol. 4, No. 2
- Branch and Round: An Enumerative Algorithm for Integer Programs
- COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
- An Introduction to the Theory of Cutting-Planes
- Enumerative Methods in Integer Programming
- Computer Codes for Problems of Integer Programming
- A hybrid approach to discrete mathematical programming
  Mathematical Programming, Vol. 14, No. 1
- An algorithm for 0‐1 multiple‐knapsack problems
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 25, No. 3
- A generalisation of variable upper bounding and generalised upper bounding
  European Journal of Operational Research, Vol. 2, No. 3
- Optimal Reliability Allocation by Branch-and-Bound Technique
  IEEE Transactions on Reliability, Vol. R-27, No. 1
- The 0–1 knapsack problem with multiple choice constraints
  European Journal of Operational Research, Vol. 2, No. 2
- Integer Programming Codes
- Cutting-plane theory: Algebraic methods
  Discrete Mathematics, Vol. 23, No. 2
- An investment planning model for the electricity sector in Nigeria
  Socio-Economic Planning Sciences, Vol. 12, No. 5
- A unified formulation of the machine scheduling problem
  European Journal of Operational Research, Vol. 2, No. 1
- COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING
- CONSIDERATIONS IN PROGRAM DESIGN AND EVALUATION
- The Consideration of Depletion in After- Tax Optimization Models
  The Engineering Economist, Vol. 24, No. 1
- AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING
  17 September 2010 | Quaestiones Mathematicae, Vol. 3, No. 2
- The cyclic separation scheduling problem
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 24, No. 4
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
  Mathematical Programming, Vol. 13, No. 1
- Experiments in mixed-integer linear programming using pseudo-costs
  Mathematical Programming, Vol. 12, No. 1
- Decomposition and Sensitivity Analysis in an Aircraft Tasking Problem
  25 May 2016 | INFOR: Information Systems and Operational Research, Vol. 15, No. 3
- DYNAMIC COURSE SCHEDULING FOR COLLEGE FACULTY VIA ZERO‐ONE PROGRAMMING*
  7 June 2007 | Decision Sciences, Vol. 8, No. 4
- An Application of Facilities Location Theory to the Design of Forest Harvesting Areas
  9 July 2007 | A I I E Transactions, Vol. 9, No. 3
- A procedure for new product positioning in an attribute space
  European Journal of Operational Research, Vol. 1, No. 4
- Un modelo matematico para la reduccion de la contaminacion atmosferica
  Trabajos de Estadistica Y de Investigacion Operativa, Vol. 28, No. 2-3
- A Survey of Recent Results for a Class of Facilities Location Problems
  A I I E Transactions, Vol. 9, No. 1
- Scheduling Multispecialty Clinics Using Integer Programming
  A I I E Transactions, Vol. 9, No. 1
- HIERARCHICAL SYSTEMS AND FUZZY‐SET THEORY
  Kybernetes, Vol. 6, No. 3
- Optimal plant location and air quality management under indivisibilities and economies of scale
  Socio-Economic Planning Sciences, Vol. 11, No. 2
- Bibliography
- How Can Specialized Discrete and Convex Optimization Methods Be Married?
- Cutting-Plane Theory: Disjunctive Methods
- Parametric Integer Programming: the Right-Hand-Side Case
- On Some Nonlinear Knapsack Problems
- Sensitivity Analysis in Integer Programming
- Solving quadratic assignment problems with rectangular distances and integer programming
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 23, No. 4
- Integer programming approaches to the travelling salesman problem
  1 December 1976 | Mathematical Programming, Vol. 10, No. 1
- Optimal Installation Program for Reprocessing Plants
  Journal of Nuclear Science and Technology, Vol. 13, No. 11
- A Sequential Approach to the $0 - 1$ Linear Programming Problem
  SIAM Journal on Applied Mathematics, Vol. 31, No. 2
- A Group Decomposition Technique in Large Integer Programming Problems
  IFAC Proceedings Volumes, Vol. 9, No. 3
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
  25 May 2016 | INFOR: Information Systems and Operational Research, Vol. 14, No. 2
- The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound Code
  9 July 2007 | A I I E Transactions, Vol. 8, No. 2
- The use of mixed integer programming for the evaluation of some alternate air pollution abatement policies
  21 May 2005
- Lösung gemischt-ganzzahliger Planungsprobleme
- A guided tour of recent practical advances in integer linear programming
  Omega, Vol. 4, No. 1
- A Proof Procedure Using Connection Graphs
  1 October 1975 | Journal of the ACM, Vol. 22, No. 4
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung
  Computing, Vol. 14, No. 3
- Optimal generator maintenance scheduling using integer programming
  IEEE Transactions on Power Apparatus and Systems, Vol. 94, No. 5
- OPTIMIZING ORGANIZATIONAL GOALS IN ASSIGNING FACULTY TEACHING SCHEDULES
  7 June 2007 | Decision Sciences, Vol. 6, No. 3
- A recursive branch and bound algorithm for the multidimensional knapsack problem
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 22, No. 2
- A model for optimal design of keyboards
  Computers & Operations Research, Vol. 2, No. 1
- An Algorithm for Large Set Partitioning Problems
- Les Procedures D’exploration et D’optimisation par Separation Et Evaluation
- The current algorithmic scope of mathematical programming systems
  23 February 2009
- References††The first comprehensive references list is due to Balinski and Spielberg (1969). A later list appears in the work of Garfinkel and Nemhauser (1972b).
- SOLUTION OF SOME COMBINATORIAL OPTIMIZATION PROBLEMS ENCOUNTERED IN WATER RESOURCES DEVELOPMENT†
  Engineering Optimization, Vol. 1, No. 3
- Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
  21 November 2006 | Naval Research Logistics Quarterly, Vol. 21, No. 4
- Improved penalty calculations for a mixed integer branch-and-bound algorithm
  Mathematical Programming, Vol. 6, No. 1
- A guided tour of recent practical advances in integer linear programming
  1 November 1974 | ACM SIGMAP Bulletin, Vol. 3, No. 17
- An Algorithm for the Bounded Variable Integer Programming Problem
  1 July 1974 | Journal of the ACM, Vol. 21, No. 3
- Probleme und Instrumente der betrieblichen Personalplanung
- Lagrangean relaxation for integer programming
  23 February 2009
- One-sided circuit of the tree of versions in the Land and Doig method
  USSR Computational Mathematics and Mathematical Physics, Vol. 13, No. 1
- Integer programming models and codes in the urban environment
  Socio-Economic Planning Sciences, Vol. 7, No. 6
- Some tactics for 0-1 programming
  1 November 1973 | ACM SIGMAP Bulletin, No. 15
- Location of health care facilities: An analytical approach
  Socio-Economic Planning Sciences, Vol. 7, No. 5
- An N-Product, Multi-Machine, Lotsize Scheduling Model
  9 July 2007 | A I I E Transactions, Vol. 5, No. 3
- Analysis of an Information System Model with Transfer Penalties
  IEEE Transactions on Computers, Vol. C-22, No. 5
- Hyperplane Search Algorithms for the Solution of Integer Programming Problems
  IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-3, No. 3
- An improved algorithm for pseudo-boolean programming
  24 May 2005
- On the Need for a System Optimization Laboratory
- A Survey of Integer Programming Emphasizing Computation and Relations among Models

Volume 18, Issue 9

May 1972

Pages 465-587

Article Information

Metrics

Information

Published Online:May 01, 1972

Cite as

A. M. Geoffrion, R. E. Marsten, (1972) Integer Programming Algorithms: A Framework and State-of-the-Art Survey. Management Science 18(9):465-491.

https://doi.org/10.1287/mnsc.18.9.465

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Integer Programming Algorithms: A Framework and State-of-the-Art Survey

Abstract

Volume 18, Issue 9

Article Information

Metrics

Information

Cite as

Sign Up for INFORMS Publications Updates and News