The following pages link to Bruce Faaland (Q2556349):
Displaying 14 items.
- On the number of solutions to a Diophantine equation (Q2556350) (← links)
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs (Q3325442) (← links)
- Log Bucking and Lumber Manufacturing Using Dynamic Programming (Q3347601) (← links)
- A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289) (← links)
- Optimal pagination of B-trees with variable-length items (Q3714476) (← links)
- Interior Path Methods for Heuristic Integer Programming Procedures (Q3885520) (← links)
- Technical Note—The Multiperiod Knapsack Problem (Q3904376) (← links)
- The Linear Fractional Portfolio Selection Problem (Q3929491) (← links)
- An Integer Programming Algorithm for Portfolio Selection (Q4060647) (← links)
- Generalized Equivalent Integer Programs and Canonical Problems (Q4060727) (← links)
- The Accelerated Bound-and-Scan Algorithm for Integer Programming (Q4081004) (← links)
- The Accelerated Bound-and-Scan Algorithm for Integer Programming (Q4096139) (← links)
- Scheduling recurrent construction (Q4651734) (← links)
- Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning (Q5684502) (← links)
