Pages that link to "Item:Q5533939"
From MaRDI portal
The following pages link to Discrete Programming by the Filter Method (Q5533939):
Displaying 28 items.
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Development of a new approach for deterministic supply chain network design (Q1027594) (← links)
- Experiments in integer programming (Q1137509) (← links)
- Discrete extremal problems (Q1152306) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung (Q1217449) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- An implicit enumeration algorithm for the all integer programming problem (Q1245147) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- Calculating uncertainty intervals in approximate equation systems (Q1294585) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- A dynamic programming solution to integer linear programs (Q2531203) (← links)
- Recursive branch and bound (Q3693268) (← links)
- On the complexity of the surrogate dual of 0–1 programming (Q3725870) (← links)
- Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben (Q3832318) (← links)
- A heuristic routine for solving large loading problems (Q3962774) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme (Q4766821) (← links)
- Trivial integer programs unsolvable by branch-and-bound (Q4770206) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables (Q5657908) (← links)
