An Improved Implicit Enumeration Approach for Integer Programming
From MaRDI portal
Publication:5562361
DOI10.1287/opre.17.3.437zbMath0174.20801OpenAlexW2015247562MaRDI QIDQ5562361
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.3.437
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A heuristic routine for solving large loading problems, A heuristic for multiple choice programming, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, Surrogate duality in a branch-and-bound procedure for integer programming, On the complexity of the surrogate dual of 0–1 programming, Minimal covering problem and PLA minimization, Discrete dynamical system approaches for Boolean polynomial optimization, A probabilistic heuristic for a computationally difficult set covering problem, Unnamed Item, Computational experience with a group theoretic integer programming algorithm, A branch and bound algorithm for the generalized assignment problem, Vertex packings: Structural properties and algorithms, Resolution of the 0–1 knapsack problem: Comparison of methods, The multidimensional 0-1 knapsack problem: an overview., Second-order cover inequalities, A survey on the continuous nonlinear resource allocation problem, An interior point algorithm to solve computationally difficult set covering problems, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Classical cuts for mixed-integer programming and branch-and-cut, Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A versatile scheme for ranking the extreme points of an assignment polytope, Mixed-integer bilinear programming problems, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung, Heuristically aided set-covering algorithms, A note on some computationally difficult set covering problems, Unnamed Item, An implicit enumeration algorithm for the all integer programming problem, Branching from the largest upper bound. Folklore and facts, Zero-one programming with many variables and few constraints, The Collapsing 0–1 Knapsack Problem, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Computational experience with an algorithm for 0-1 integer programming, An Enterprise Risk Management Model for Supply Chains, Development of a new approach for deterministic supply chain network design, An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem, Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds, Large-scale mixed integer programming: Benders-type heuristics, Zero-one integer programs with few contraints - lower bounding theory, On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, Implied constraints and a unified theory of duality in linear and nonlinear programming
