Pages that link to "Item:Q1014935"
From MaRDI portal
The following pages link to A trust branching path heuristic for zero-one programming (Q1014935):
Displaying 4 items.
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- Piecewise convex maximization approach to multiknapsack (Q3646095) (← links)
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems (Q5321691) (← links)