AAAAAA
Results:
1-9
|
Results: 9
Authors:
IWATA S
MATSUI T
MCCORMICK ST
Citation: S. Iwata et al., A FAST BIPARTITE NETWORK FLOW ALGORITHM FOR SELECTIVE ASSEMBLY, Operations research letters, 22(4-5), 1998, pp. 137-143
Authors:
KARZANOV AV
MCCORMICK ST
Citation: Av. Karzanov et St. Mccormick, POLYNOMIAL METHODS FOR SEPARABLE CONVEX-OPTIMIZATION IN UNIMODULAR LINEAR-SPACES WITH APPLICATIONS, SIAM journal on computing, 26(4), 1997, pp. 1245-1275
Authors:
MCCORMICK ST
Citation: St. Mccormick, HOW TO COMPUTE LEAST INFEASIBLE FLOWS, Mathematical programming, 78(2), 1997, pp. 179-194
Authors:
MCCORMICK ST
Citation: St. Mccormick, SUBMODULAR CONTAINMENT IS HARD, EVEN FOR NETWORKS, Operations research letters, 19(2), 1996, pp. 95-99
Authors:
MCCORMICK ST
ERVOLINA TR
Citation: St. Mccormick et Tr. Ervolina, COMPUTING MAXIMUM MEAN CUTS, Discrete applied mathematics, 52(1), 1994, pp. 53-70
Authors:
MCCORMICK ST
RAO US
Citation: St. Mccormick et Us. Rao, SOME COMPLEXITY RESULTS IN CYCLIC SCHEDULING, Mathematical and computer modelling, 20(2), 1994, pp. 107-122
Authors:
ERVOLINA TR
MCCORMICK ST
Citation: Tr. Ervolina et St. Mccormick, 2 STRONGLY POLYNOMIAL CUT CANCELING ALGORITHMS FOR MINIMUM-COST NETWORK FLOW, Discrete applied mathematics, 46(2), 1993, pp. 133-165
Authors:
MCCORMICK ST
Citation: St. Mccormick, APPROXIMATE BINARY SEARCH ALGORITHMS FOR MEAN CUTS AND CYCLES, Operations research letters, 14(3), 1993, pp. 129-132
Authors:
CHANG SF
MCCORMICK ST
Citation: Sf. Chang et St. Mccormick, IMPLEMENTATION AND COMPUTATIONAL RESULTS FOR THE HIERARCHICAL ALGORITHM FOR MAKING SPARSE MATRICES SPARSER, ACM transactions on mathematical software, 19(3), 1993, pp. 419-441
Risultati:
1-9
|