Integer Programming by Implicit Enumeration and Balas’ Method
From MaRDI portal
Publication:5615773
DOI10.1137/1009031zbMath0213.44702OpenAlexW2093150123MaRDI QIDQ5615773
Publication date: 1967
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/108775450d28ff3aeae9862084c4c0d582068a3b
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, A branch and bound algorithm for extreme point mathematical programming problems, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, A heuristic for multiple choice programming, An optimization model to determine master designs and runs for advertisement printing, Experiments in integer programming, Enumerative inequalities in integer programming, An implicit enumeration program for zero-one integer programming, Resolution of the 0–1 knapsack problem: Comparison of methods, Models and methods of solution of quadratic integer programming problems, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S, A revised Taha's algorithm for polynomial 0-1 programming, Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung, Cost-minimal trees in directed acyclic graphs, Unnamed Item, An implicit enumeration algorithm for the all integer programming problem, Preventing redundant solutions in partial enumeration algorithms, Some new perspectives for solving 0--1 integer programming problems using balas method, Theoretical comparisons of search strategies in branch-and-bound algorithms, Calculating uncertainty intervals in approximate equation systems, On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm, Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds, Zero-one integer programs with few contraints - lower bounding theory, Optimal expansion of an existing network
