The following pages link to S. M. Johnson (Q2556309):
Displaying 21 items.
- Upper bounds for constant weight error correcting codes (Q2556310) (← links)
- Sequential production planning over time at minimum cost (Q2778581) (← links)
- A linear programming approach to the chemical equilibrium problem (Q2778594) (← links)
- Discussion: sequencing \(n\) jobs on two machines with arbitrary time lags (Q2778608) (← links)
- Optimal two- and three-stage production schedules with set-up time included (Q2834736) (← links)
- On Sequential Designs for Maximizing the Sum of $n$ Observations (Q3234931) (← links)
- A Linear Diophantine Problem (Q3274228) (← links)
- (Q3285920) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q3565230) (← links)
- Improved asymptotic bounds for error-correcting codes (Q4768969) (← links)
- Nonstuck behaviour of open circuit supply faults in CMOS logic circuits (Q4880991) (← links)
- (Q5332986) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q5378639) (← links)
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem (Q5378843) (← links)
- An Elementary Remark on Maximal Gaps Between Successive Primes (Q5524499) (← links)
- On upper bounds for unrestricted binary-error-correcting codes (Q5639605) (← links)
- (Q5682335) (← links)
- Generation of Permutations by Adjacent Transposition (Q5721208) (← links)
- Sequential Minimax Search for a Zero of a Convex Function (Q5721381) (← links)
- On the Representations of an Integer as the Sum of Products of Integers (Q5827014) (← links)
- A Tournament Problem (Q5895867) (← links)
