R-DOMINATION ON BLOCK GRAPHSCHANG GJ; NEMHAUSER GL.1982; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 6; PP. 214-218; BIBL. 12 REF.Article

AN APPLICATION OF VERTEX PACKING TO DATA ANALYSIS IN THE EVALUATION OF PAVEMENT DETERIORATIONGATTASS EA; NEMHAUSER GL.1981; OPER. RES. LETT.; NLD; DA. 1981; VOL. 1; NO 1; PP. 13-17; BIBL. 6 REF.Article

OPTIMAL SET PARTITIONING, MATCHINGS AND LAGRANGIAN DUALITYNEMHAUSER GL; WEBER GM.1979; NAV. RES. LOGIST. QUART.; USA; DA. 1979; VOL. 26; NO 4; PP. 553-563; BIBL. 15 REF.Article

TIGHT BOUNDS FOR CHRISTOFIDES' TRAVELING SALESMAN HEURISTIC.CORNUEJOLS G; NEMHAUSER GL.1978; MATH. PROGRAMMG; NETHERL.; DA. 1978; VOL. 14; NO 1; PP. 116-121; BIBL. 1 REF.Article

MATROID AND A RELIABILITY ANALYSIS PROBLEMBALL MO; NEMHAUSER GL.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 2; PP. 132-143; BIBL. 10 REF.Article

ALGORITHMS FOR MINIMUM COVERING BY CLIQUES AND MAXIMUM CLIQUE IN CLAW-FREE PERFECT GRAPHSHSU WL; NEMHAUSER GL.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 181-191; BIBL. 11 REF.Article

A PROBLEM IN BULK SERVICE SCHEDULINGNEMHAUSER GL; YU PL.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 4; PP. 813-819; BIBL. 2 REF.Serial Issue

VERTEX PACKINGS: STRUCTURAL PROPERTIES AND ALGORITHMS.NEMHAUSER GL; TROTTER LE JR.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 8; NO 2; PP. 232-248; BIBL. 18 REF.Article

BEST ALGORITHMS FOR APPROXIMATING THE MAXIMUM OF A SUBMODULAR SET FUNCTIONNEMHAUSER GL; WOLSEY LA.1978; MATH. OPER. RES.; USA; DA. 1978; VOL. 3; NO 3; PP. 177-188; BIBL. 3 REF.Article

SOME INEQUALITIES ON THE CHROMATIC NUMBER OF A GRAPH.KING T; NEMHAUSER GL.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 10; NO 1-2; PP. 117-121; BIBL. 9 REF.Article

TEMPORAL EXPANSION OF A TRANSPORTATION NETWORK. IFREY SC JR; NEMHAUSER GL.1972; TRANSPORT. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 3; PP. 306-323; BIBL. 10 REF.Serial Issue

TEMPORAL EXPANSION OF A TRANSPORTATION NETWORK. IIFREY SC JR; NEMHAUSER GL.1972; TRANSPORT. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 4; PP. 395-406; BIBL. 2 REF.Serial Issue

WORST-CASE AND PROBABILISTIC ANALYSIS OF ALGORITHMS FOR A LOCATION PROBLEMCORNUEJOLS G; NEMHAUSER GL; WOLSEY LA et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 4; PP. 847-858; BIBL. 10 REF.Article

AN ANALYSIS OF APPROXIMATIONS FOR FINDING A MAXIMUM WEIGHT HAMILTONIAN CIRCUITFISHER ML; NEMHAUSER GL; WOLSEY LA et al.1979; OPER. RES.; USA; DA. 1979; VOL. 27; NO 4; PP. 799-809; BIBL. 10 REF.Article

A POLYNOMIAL ALGORITHM FOR MAXIMUM WEIGHTED VERTEX PACKINGS ON GRAPHS WITHOUT LONG ODD CYCLESWEN LIAN HSU; IKURA Y; NEMHAUSER GL et al.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 20; NO 2; PP. 225-232; BIBL. 13 REF.Article

SET PARTITIONING AND CHAIN DECOMPOSITION.NEMHAUSER GL; TROTTER LE JR; NAUSS RM et al.1974; MANAG. SCI.; U.S.A.; DA. 1974; VOL. 20; NO 11; PP. 1413-1423; BIBL. 12 REF.Article

WHEN THE GREEDY SOLUTION SOLVES A CLASS OF KNAPSACK PROBLEMS.MAGAZINE MJ; NEMHAUSER GL; TROTTER LE JR et al.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 207-217; BIBL. 11 REF.Article