Discrete Programming by the Filter Method
From MaRDI portal
Publication:5533939
DOI10.1287/opre.15.5.915zbMath0153.21401OpenAlexW2169849417WikidataQ100604536 ScholiaQ100604536MaRDI QIDQ5533939
Publication date: 1967
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.15.5.915
Related Items
A heuristic routine for solving large loading problems, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, On the complexity of the surrogate dual of 0–1 programming, Experiments in integer programming, Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem, Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables, Dominance rules in combinatorial optimization problems, Discrete extremal problems, An implicit enumeration program for zero-one integer programming, An effective structured approach to finding optimal partitions of networks, Resolution of the 0–1 knapsack problem: Comparison of methods, The multidimensional 0-1 knapsack problem: an overview., A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben, Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung, Application of optimization methods to the hematological support of patients with disseminated malignancies, An algorithm for the 0/1 Knapsack problem, Unnamed Item, An implicit enumeration algorithm for the all integer programming problem, A dynamic programming solution to integer linear programs, Theoretical comparisons of search strategies in branch-and-bound algorithms, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, Job-shop scheduling with resource-time models of operations, 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, Calculating uncertainty intervals in approximate equation systems, Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme, Trivial integer programs unsolvable by branch-and-bound, Recursive branch and bound, On generalized surrogate duality in mixed-integer nonlinear programming
