The following pages link to Robert M. Nauss (Q1115801):
Displaying 18 items.
- (Q1089253) (redirect page) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- On the use of internal rate of return in linear and integer programming (Q1115802) (← links)
- The 0-1 knapsack problem with multiple choice constraints (Q1248462) (← links)
- Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
- Staffing geographically distributed service facilities with itinerant personnel (Q1867100) (← links)
- Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock (Q2467271) (← links)
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach (Q2884558) (← links)
- (Q3372332) (← links)
- True Interest Cost in Municipal Bond Bidding: An Integer Programming Approach (Q3737148) (← links)
- Minimizing Net Interest Cost in Municipal Bond Bidding (Q3901291) (← links)
- (Q3901292) (← links)
- Theory and Application of an Optimizing Procedure for Lock Box Location Analysis (Q3911656) (← links)
- Set Partitioning and Chain Decomposition (Q4068444) (← links)
- An Efficient Algorithm for the 0-1 Knapsack Problem (Q4105496) (← links)
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming (Q4132253) (← links)
- An Improved Algorithm for the Capacitated Facility Location Problem (Q4187579) (← links)
- The elastic generalized assignment problem (Q4678203) (← links)
