A TECHNIQUE FOR DETERMINING BLOCKING AND ANTI-BLOCKING POLYHEDRAL DESCRIPTIONSHUANG HC; TROTTER LE JR.1980; MATH. PROGRAMMG STUDY; NLD; DA. 1980; NO 12; PP. 197-205; BIBL. 17 REF.Article

ALGORITHME D'UNE METHODE COMBINATOIRE D'APPROXIMATION POUR LA RESOLUTION D'UN PROBLEME DE REPARTITION AVEC DES VARIABLES BOOLEENNESKALDYBAEV SU.1975; IZVEST. AKAD. NAUK KAZAKH. S.S.R., SER. FIZ.-MAT.; S.S.S.R.; DA. 1975; VOL. 30; NO 5; PP. 43-49Article

THE ROLE OF PUZZLES IN TEACHING COMBINATORIAL PROGRAMMING.MULLER MERBACH H.1975; INT: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 379-386Conference Paper

COMBINATORIAL OPTIMIZATION WITH RATIONAL OBJECTIVE FUNCTIONS: A COMMUNICATIONAHUJA RK; BATRA JL; GUPTA SK et al.1983; MATHEMATICS OF OPERATIONS RESEARCH; ISSN 0364-765X; USA; DA. 1983; VOL. 8; NO 2; PP. 314; BIBL. 1 REF.Article

WORST-CASE ANALYSIS FOR A CLASS OF COMBINATORIAL OPTIMIZATION ALGORITHMS.HAUSMANN D; KORTE B.1978; LECTURE NOTES CONTROL INFORM. SCI.; GERM.; DA. 1978; VOL. 7; PP. 216-224; BIBL. 7 REF.; (OPTIMIZATION TECH. IFIP CONF. 8. PROC. II; WUERZBURG; 1977)Conference Paper

APPLICATION DE LA METHODE DU VECTEUR DE DESCENTE A LA RESOLUTION DES PROBLEMES D'OPTIMISATION DE TYPE COMBINATOIRESERGIENKO IV.1975; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1975; NO 2; PP. 86-94; ABS. ANGL.; BIBL. 25 REF.Article

PROGRAMMATION COMBINATOIRE.GONDRAN M.1974; ELECTR. FR., BULL. DIRECT. ET. RECH., C; FR.; DA. 1974; NO 2; PP. 45-65Article

IMPROVED COMBINATORIAL PROGRAMMING ALGORITHMS FOR A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMSPIERCE JF; LASKY JS.1973; MANAG. SCI.; U.S.A.; DA. 1973; VOL. 19; NO 5; PP. 528-543; BIBL. 1 P. 1/2Serial Issue

PROBLEMES DISCRETS ET METHODES ARBORESCENTESFRIDMAN AA; VOTYAKOV AA.1974; EKON. MAT. METODY; S.S.S.R.; DA. 1974; VOL. 10; NO 3; PP. 611-620; BIBL. 4 REF.Article

REGULAR (2,2)-SYSTEMSEULER R.1982; MATHEMATICAL PROGRAMMING; ISSN 0025-5610; NLD; DA. 1982; VOL. 24; NO 3; PP. 269-283; BIBL. 16 REF.Article

UN CAS RESOLUBLE EN PROGRAMMATION DISCRETEVOLODARSKIJ YAM; GABOVICH E YA; ZAKHARIN A YA et al.1976; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1976; NO 1; PP. 34-44; BIBL. 19 REF.Article

MATROID INTERSECTION ALGORITHMS.LAWLER EL.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 9; NO 1; PP. 31-56; BIBL. 10 REF.Article

LES PROCEDURES D'EXPLORATION ET D'OPTIMISATION PAR SEPARATION ET EVALUATION.HANSEN P.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 29-65; BIBL. DISSEM.Conference Paper

NUMERISCHE METHODEN BEI GRAPHENTHEORETISCHEN UND KOMBINATORISCHEN PROBLEMEN. VORTRAGSAUSZUEGE DER TAGUNG UEBER NUMERISCHE METHODEN DER GRAPHENTHEORIE UND KOMBINATORIK; OBERWALFACH SCHWARZWALD; 1974. = METHODES NUMERIQUES POUR LA THEORIE DES GRAPHES ET LES PROBLEMES DE COMBINATOIRE. RAPPORT DES JOURNEES SUR LES METHODES NUMERIQUES DE LA THEORIE DES GRAPHES ET DE LA COMBINATOIRE OBERWALFACH. SCHWARZWALD; 19741975; SER. INTERNATION. ANAL. NUMER.; SUISSE; DA. 1975; VOL. 29; PP. 1-159; ABS. ANGL.; BIBL. DISSEM.Conference Paper

PROBLEME D'AFFECTATIONSUPRUNENKO DA.1974; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1974; NO 4; PP. 5-10; BIBL. 4 REF.Article

POLARITIES GIVEN BY SYSTEMS OF BILINEAR INEQUALITIESARAOZ DJ; EDMONDS J; GRIFFIN VJ et al.1983; MATHEMATICS OF OPERATIONS RESEARCH; ISSN 0364-765X; USA; DA. 1983; VOL. 8; NO 1; PP. 34-41; BIBL. 9 REF.Article

SUR LES TRAVAUX DES MATHEMATICIENS BIELORUSSES DANS LE DOMAINE DE L'OPTIMISATION DISCRETEEMELICHEV VA; SUPRUNENKO DA; TANAEV VS et al.1982; IZVESTIJA AKEDEMII NAUK SSSR. TEHNICESKAJA KIBERNETIKA; ISSN 0002-3388; SUN; DA. 1982; NO 6; PP. 25-45; BIBL. 60 REF.Article

SUR LA DETERMINATION D'UN COMITE D'UN SYSTEME D'INEGALITES PONDEREESBORDETSKIJ AB; KAZARINOV LS.1981; KIBERNETIKA; UKR; DA. 1981; NO 6; PP. 44-48; BIBL. 6 REF.Article

POINT ESTIMATION OF A GLOBAL OPTIMUM FOR LARGE COMBINATORIAL PROBLEMSGOLDEN BL.1978; COMMUNIC. STATIST., SIMUL. COMPUT.; USA; DA. 1978; VOL. 7; NO 4; PP. 361-367; BIBL. 13 REF.Article

SCHEDULING JOBS OF EQUAL DURATIONS WITH TARDINESS COSTS AND RESOURCE LIMITATIONS.TREMOLIERES R.1978; J. OPERAT. RES. SOC.; G.B.; DA. 1978; VOL. 29; NO 3; PP. 229-233; BIBL. 8 REF.Article

TRANSFORMATION DU PROBLEME DE PARTITIONNEMENT EN UN PROBLEME D'ENSEMBLE STABLE DE POIDS MAXIMALBILLIONNET A.1978; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1978; VOL. 12; NO 3; PP. 319-323; BIBL. 9 REF.Article

QUELQUES CAS DE REDUCTIBILITE DU PROBLEME DE JOHNSON A M MACHINES A UN PROBLEME A DEUX MACHINESGLEBOV NI.1978; UPRAVL. SISTEMY; SUN; DA. 1978; NO 17; PP. 46-51; BIBL. 4 REF.Article

SENSITIVITY ANALYSIS OF THE CLASSICAL TRANSPORTATION PROBLEM. A COMBINATORIAL APPROACH.INTRATOR J; PAROUSH J.1977; COMPUTERS OPER. RES.; G.B.; DA. 1977; VOL. 4; NO 3; PP. 213-226; BIBL. 7 REF.Article

CONTROLLING CUTTING PATTERN CHANGES IN ONE-DIMENSIONAL TRIM PROBLEMS.HAESSLER RW.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 3; PP. 483-493; BIBL. 10 REF.Article

POLYHEDRAL ANNEXATION IN MIXED INTEGER AND COMBINATORIAL PROGRAMMING.GLOVER F.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 9; NO 2; PP. 161-188; BIBL. 1 P.Article