The following pages link to A. Victor Cabot (Q1332813):
Displaying 17 items.
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- A genetic algorithm for discriminant analysis. Selected topic area: MS/OR: Techniques, models and applications (Q1385335) (← links)
- (Q1894736) (redirect page) (← links)
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
- A branch and bound network approach to the canonical constrained entropy problem (Q1900273) (← links)
- The application of generalized Benders decomposition to certain nonconcave programs (Q2640445) (← links)
- Some branch-and-bound procedures for fixed-cost transportation problems (Q3323706) (← links)
- Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation (Q3735468) (← links)
- A branch and bound algorithm for solving a class of nonlinear integer programming problems (Q3757685) (← links)
- Variations on a cutting plane method for solving concave minimization problems with linear constraints (Q4119020) (← links)
- Maximizing the sum of certain quasiconcave functions using generalized benders decomposition (Q4175056) (← links)
- An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998) (← links)
- An Approach to Zero-One Integer Programming (Q5552014) (← links)
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points (Q5580062) (← links)
- An Enumeration Algorithm for Knapsack Problems (Q5591244) (← links)
- Properties of a multifacility location problem involving euclidian distances (Q5678631) (← links)
