Pages that link to "Item:Q5580091"
From MaRDI portal
The following pages link to Letter to the Editor—A Note on the Branch-and-Bound Principle (Q5580091):
Displaying 11 items.
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Discrete solutions to engineering design problems (Q1213829) (← links)
- A continuous approach to nonlinear integer programming (Q1824556) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben (Q5558794) (← links)