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

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

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

ASPECTS POLYEDRAUX DE L'OPTIMISATION DISCRETEEMELICHEV VA; KOVALEV MM.1982; KIBERNETIKA; ISSN 506850; UKR; DA. 1982; NO 6; PP. 54-62; BIBL. 60 REF.Article

NOTION DE LINEARITE ET DE CONVEXITE DANS UN ESPACE DISCRET. PROBLEMES LINEAIRES COMBINATOIRES. IIKASPSHITSKAYA MF; SERGIENKO IV.1980; KIBERNETIKA; UKR; DA. 1980; NO 1; PP. 1-5; BIBL. 2 REF.Article

QUELQUES PROPRIETES DES RECOUVREMENTS DE TABLES BINAIRESUSTYUZHANINOV VG.1979; KIBERNETIKA; UKR; DA. 1979; NO 4; PP. 7-15; ABS. ENG; BIBL. 10 REF.Article

EIN WEITERER KOMBINATORISCHER ALGORITHMUS FUER 0-1-OPTIMIERUNGSAUFGABEN. I: THEORETISCHE GRUNDLAGEN = UN ALGORITHME COMBINATOIRE APPROFONDI POUR DES PROBLEMES D'OPTIMISATION 0-1. I. FONDEMENTS THEORIQUESSCHOCH M; LYSKA W.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1978; VOL. 9; NO 3; PP. 307-320; ABS. ENG/RUS; BIBL. 4 REF.Article

OPTIMISATION DES FONCTIONS DEFINIES PAR RECURRENCE SUR DES ENSEMBLES DE PERMUTATIONSTANAEV VS.1977; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1977; NO 3; PP. 27-30; BIBL. 5 REF.Article

REVUE DE QUELQUES RESULTATS RELATIFS AUX PROBLEMES DE RECOUVREMENTSALOZHENKO AA; ASRATYAN AS; KUZYURIN NN et al.1977; METODY DISKRETN. ANAL.; SUN; DA. 1977; NO 30; PP. 46-75; BIBL. 91 REF.Article

ALGORITHME DE RESOLUTION DES PROBLEMES COMBINATOIRESSHARASHIDZE GK.1976; ELEKTRON. I MODELIROVAN., U.S.S.R.; S.S.S.R.; DA. 1976; NO 13; PP. 79-82; BIBL. 2 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

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

SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS: CLASSIFICATION AND COMPLEXITYBLAZEWICZ J; LENSTRA JK; RINNOOY KAN AHG et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 11-24; BIBL. 13 REF.Conference Paper

SURROGATE DUALITY RELAXATION FOR JOB SHOP SCHEDULINGFISHER ML; LAGEWEG BJ; LENSTRA JK et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 65-75; BIBL. 34 REF.Conference Paper

GRUNDLAGEN ZUR KONSTRUKTION KOMBINATORISCHER ALGORITHMEN MIT HILFE EINER ERZEUGUNGSVORSCHRIFT FUER GANZZAHLIGE VEKTOREN = CONSTRUCTION D'ALGORITHMES COMBINATOIRES A L'AIDE D'UNE REGLE DE CALCUL POUR DES VECTEURS ENTIERSSCHREIER H.1983; MATHEMATISCHE OPERATIONSFORSCHUNG UND STATISTIK. SERIES OPTIMIZATION; ISSN 0323-3898; DDR; DA. 1983; VOL. 14; NO 2; PP. 183-196; ABS. ENG/RUS; BIBL. 4 REF.Article

METHODE GENERALISEE DE DECOMPOSITION DES SCHEMAS-GRAPHES D'ALGORITHMESBARANOV SI; ZHURAVINA LN; PESCHANSKIJ VA et al.1982; AVTOMATIKA I VYCISLITEL'NAJA TEHNIKA; ISSN 504858; SUN; DA. 1982; NO 5; PP. 43-51; BIBL. 5 REF.Article

AN ALGORITHM FOR EXHAUSTIVE GENERATION OF BUILDING FLOOR PLANSGALLE P.1981; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1981; VOL. 24; NO 12; PP. 813-825; BIBL. 46 REF.Article

CERTAIN KINDS OF POLAR SETS AND THEIR RELATION TO MATHEMATICAL PROGRAMMINGTIND J.1980; MATH. PROGRAMMG STUDY; NLD; DA. 1980; NO 12; PP. 206-213; BIBL. 11 REF.Article

WEIGHTED SATISFIABILITY PROBLEMS AND SOME IMPLICATIONSCAMERINI PM; MAFFIOLI F.1980; LECTURE NOTES CONTROL INFORM. SCI.; DEU; DA. 1980; NO 23; PP. 170-175; BIBL. 7 REF.Conference Paper