Discrete Programming by the Filter Method
From MaRDI portal
Cited in
(32)- Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme
- A heuristic routine for solving large loading problems
- An implicit enumeration algorithm for the all integer programming problem
- An algorithm for the 0/1 Knapsack problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
- scientific article; zbMATH DE number 3390546 (Why is no real title available?)
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- On the complexity of the surrogate dual of 0–1 programming
- Trivial integer programs unsolvable by branch-and-bound
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
- Calculating uncertainty intervals in approximate equation systems
- Resolution of the 0–1 knapsack problem: Comparison of methods
- Development of a new approach for deterministic supply chain network design
- Discrete extremal problems
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- An effective structured approach to finding optimal partitions of networks
- Job-shop scheduling with resource-time models of operations
- Recursive branch and bound
- Dominance rules in combinatorial optimization problems
- The multidimensional 0-1 knapsack problem: an overview.
- An implicit enumeration program for zero-one integer programming
- A new hybrid parallel genetic algorithm for the job-shop scheduling problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- A dynamic programming solution to integer linear programs
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Experiments in integer programming
- Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
- Application of optimization methods to the hematological support of patients with disseminated malignancies
- Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
This page was built for publication: Discrete Programming by the Filter Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5533939)
