The following pages link to Patrick G. McKeown (Q1609906):
Displayed 16 items.
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← links)
- On solving the continuous data editing problem (Q1919203) (← links)
- Tabu search applied to the general fixed charge problem (Q2367015) (← links)
- An algorithm for solving fixed-charge problems using surrogate constraints (Q2638935) (← links)
- A branch-and-bound algorithm for solving fixed charge problems (Q3320127) (← links)
- (Q3883917) (← links)
- An easy solution for a special class of fixed charge problems (Q3893674) (← links)
- Solving incremental quantity discounted transportation problems by vertex ranking (Q3895227) (← links)
- The pure fixed charge transportation problem (Q3960466) (← links)
- Adjacent vertices on transportation polytopes (Q4079320) (← links)
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem (Q4096140) (← links)
- Determining adjacent vertices on assignment polytopes (Q4118984) (← links)
- Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems (Q4171518) (← links)
- Note—Multiplicative Interval Variation of Objective Function Coefficients in Linear Programming (Q4740349) (← links)
- A Mathematical Programming Approach to Editing of Continuous Survey Data (Q5185820) (← links)