scientific article; zbMATH DE number 3908168
[For the entire collection see Zbl 0566.00033.] Following an introduction, which discusses the motivation for studying integer programming, the relevance of computational complexity and the relative merits of integer and dynamic programming, the branch and bound method is introduced in general terms. Various types of global entity to which it can be applied are introduced. These are integer variables, semicontinuous variables, special ordered sets and chains of linked ordered sets. A discussion of the algorithmic details follows. Finally, various approaches to automatic model reformulation are discussed: this seems to be the most important current area of integer programming research.
- Integer programming and related areas. A classified bibliography 1984- 1987. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- Computational integer programming
- Solving integer programs with a few important binary gub constraints
- Integer programming for urban design
- Simple majority rule and integer programming
- A polyhedral study of the semi-continuous knapsack problem
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- Integer programming for media streams planning problem
- Recent advances in integer programming
- The problem with integer programming
- Integer Programming Subject to Monomial Constraints
- scientific article; zbMATH DE number 6007926 (Why is no real title available?)
- Some integer programs arising in the design of main frame computers
- Integer Programming
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- Satisfying the customer
- An integer programming model for the optimization of data cycle maps
- Integer programming: methods, uses, computation
- Fifty-plus years of combinatorial integer programming
- An Exploratory Study for Identifying and Implementing Concerns in Integer Programming
- scientific article; zbMATH DE number 3908169 (Why is no real title available?)
- Recursive branch and bound
- scientific article; zbMATH DE number 3968334 (Why is no real title available?)
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Some Lessons in Solving Practical Integer Programs
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 549930 (Why is no real title available?)
- scientific article; zbMATH DE number 640713 (Why is no real title available?)
- Decomposing integer programming models for spatial allocation
- scientific article; zbMATH DE number 2159271 (Why is no real title available?)
- scientific article; zbMATH DE number 3997559 (Why is no real title available?)
- Integer Programming to Minimize Labour Costs
- The Integrality Number of an Integer Program
- Integer Programming
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Integer programming for telecommunications
- Branch and bound, integer, and non-integer programming
- An integer programming approach to optimize Housing Benefit data retrieval
- An integer equation controlled descending path to a protean pure integer program
- Revisiting integer program: complexity, arithmetic, basic variables, and scope
- Formulations and Reformulations in Integer Programming
- The formulation and solution of discrete optimisation models
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Preface
- A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
- Inverse integer programming
- Branch and bound with estimation based on pseudo-shadow-prices
- Logical processing for integer programming
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686501)