Integer Programming Algorithms: A Framework and State-of-the-Art Survey
From MaRDI portal
Publication:5650509
DOI10.1287/MNSC.18.9.465zbMath0238.90043OpenAlexW2169666402MaRDI QIDQ5650509
A. M. Geoffrion, Roy E. Marsten
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.9.465
Related Items (68)
Extended omega ratio optimization for risk‐averse investors ⋮ Exact methods for the knapsack problem and its generalizations ⋮ The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm ⋮ Scheduling a project to maximize its net present value: An integer programming approach ⋮ The reduced cost branch and bound algorithm for mixed integer programming ⋮ Optimizing single-terminal dispatch of large volume trips to trucks ⋮ A heuristic for multiple choice programming ⋮ Unnamed Item ⋮ Nonconvex optimization over a polytope using generalized capacity improvement ⋮ Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information ⋮ On the use of internal rate of return in linear and integer programming ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ A randomized parallel branch-and-bound algorithm ⋮ Incumbent solutions in branch-and-bound algorithms: Setting the record straight ⋮ The integer linear complementarity problem ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Spectral projected subgradient with a momentum term for the Lagrangean dual approach ⋮ Experiments in integer programming ⋮ Implicit enumeration algorithms for the set-partitioning problem ⋮ A classroom/time assignment model ⋮ On maintenance scheduling of production units ⋮ Use of penalties in a branch and bound procedure for the fixed charge transportation problem ⋮ Parametric integer linear programming: A synthesis of branch and bound with cutting planes ⋮ An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds ⋮ Linear complementarity problems solvable by integer programming ⋮ A class of problems of optimal net synthesis ⋮ Locational analysis ⋮ An algorithm for disjunctive programs ⋮ Improved penalty calculations for a mixed integer branch-and-bound algorithm ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Dynamic location problems with radial structure of the components of the connecting graph ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Ordering scheduling problem in manufacturing systems ⋮ Integer programming approaches to the travelling salesman problem ⋮ Composite stock cutting through simulated annealing ⋮ Algorithms for robust single and multiple period layout planning for manufacturing systems ⋮ Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung ⋮ Experiments in mixed-integer linear programming using pseudo-costs ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ Using branch-and-bound algorithms to obtain suboptimal solutions ⋮ HIERARCHICAL SYSTEMS AND FUZZY‐SET THEORY ⋮ Solving quadratic assignment problems with rectangular distances and integer programming ⋮ A procedure for new product positioning in an attribute space ⋮ The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results ⋮ A unified formulation of the machine scheduling problem ⋮ A generalisation of variable upper bounding and generalised upper bounding ⋮ The 0-1 knapsack problem with multiple choice constraints ⋮ A surrogate-based heuristic for production planning problem of orders in small foundries ⋮ A hybrid approach to discrete mathematical programming ⋮ An algorithm and efficient data structures for the binary knapsack problem ⋮ A method for convex black-box integer global optimization ⋮ Cutting-plane theory: Algebraic methods ⋮ AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ A multiple-tree search procedure for the resource-constrained project scheduling problem ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ A one-dimensional cutting stock problem in the aluminium industry and its solution ⋮ Solving zero-one multiple objective programs through implicit enumeration ⋮ The best parameter subset using the Chebychev curve fitting criterion ⋮ Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds ⋮ Mixed-integer quadratic programming ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ The transportation problem with exclusionary side constraints and two branch-and-bound algorithms ⋮ Solving capacitated clustering problems ⋮ Modeling uncertainty in networks ⋮ An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type ⋮ An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
This page was built for publication: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
