|
T57.7 .G37
|
Integer programming / |
1 |
|
T57.7 .G52
|
Accelerating the determination of the first facets of the octahedron / |
1 |
|
T57.7 .G524
|
Aggregating diophantine equations / |
1 |
|
T57.7 .G528
|
Comprehensive computer evaluation and enhancement of maximum flow algorithms / |
1 |
|
T57.7 .G53
|
Convexity cuts and cut search / |
1 |
|
T57.7 .G532
|
Convexity cuts for multiple choice problems / |
1 |
|
T57.7 .G533
|
Cut-search methods in integer programming / |
1 |
|
T57.7 .G535
|
"Direct" Benders cuts for fixed charge problems by a primal compactification / |
1 |
|
T57.7 .G5352
|
The disjunctive facet problem : formulation and solution techniques / |
1 |
|
T57.7 .G54
|
Finding equivalent transportation formulations for constrained transportation problems / |
1 |
|
T57.7 .G545
|
A fresh look at heuristic principles for integer programming / |
1 |
|
T57.7 .G547
|
Further reduction of zero-one polynomial programming problems to zero-one linear programming problems / |
1 |
|
T57.7 .G5484
|
Higher order tree dual approximation methods for the distribution problem / |
1 |
|
T57.7 .G55
|
Inequalities for mixed integer programs with structure / |
1 |
|
T57.7 .G56
|
Mathematical programming models and methods for the journal selection problem / |
1 |
|
T57.7 .G565
|
Note on converting the 0-1 polynomial programming problem to a 0-1 linear program / |
1 |
|
T57.7 .G568
|
On polyhedral annexation and generating the facets of the convex hull of feasible solutions to mixed integer programming problems / |
1 |
|
T57.7 .G57
|
Parametric branch and bound / |
1 |
|
T57.7 .G587
|
Surrogate constraint duality in mathematical programming / |
1 |
|
T57.7 .G74
|
Integer programming. |
1 |
