SOLUTION OF TWO DIFFICULT COMBINATORIAL PROBLEMS WITH LINEAR ALGEBRAPROCTOR RA.1982; AM. MATH. MON.; ISSN 0002-9890; USA; DA. 1982; VOL. 89; NO 10; PP. 721-734; BIBL. 22 REF.Article

ON THE "PROBLEME DES MENAGES"TAKACS L.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 36; NO 3; PP. 289-297; BIBL. 42 REF.Article

DOMINANCE AND OPTIMAL LOCATIONWHITE DJ.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 9; NO 3; PP. 309; BIBL. 1 REF.Article

MINIMEAN LOCATION OF DIFFERENT FACILITIES ON A LINE NETWORKHULME BL; SLATER PJ.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 4; PP. 411-415; BIBL. 10 REF.Article

THE CUTTING STOCK PROBLEM WITH SEVERAL OBJECTIVE FUNCTIONS AND IN FUZZY CONDITIONSFABIAN C; DUTA DL.1982; ECON. COMPUT. ECON. CYBERN. STUD. RES.; ISSN 0424-267X; ROM; DA. 1982; VOL. 17; NO 2; PP. 43-47; ABS. FRE/RUS; BIBL. 5 REF.Article

HIERARCHAL LOCATION-ALLOCATION PROBLEMSNARULA SC.1981; ISOLDE 81. INTERNATIONAL CONFERENCE ON LOCATIONAL DECISIONS. 2/1981/SKODSBORG; DNK; LYNGBY: IMSOR; DA. 1981; PP. 375-391; BIBL. 11 REF.Conference Paper

ON THE UNCAPACITATED PLANT LOCATION PROBLEM II: FACETS AND LIFTING THEOREMSCHINHYUNG CHO D; PADBERG MANFRED W; RAD MR et al.1981; ; FRA; LE CHESNAY: IMPR. I.N.R.I.A.; DA. 1981; INRIA/87; 42 P.; 30 CM; ABS. FRE; BIBL. 6 REF.; RAPPORTS DE RECHERCHE; 87;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 87]Report

IMPLEMENTATION AND TESTING OF A PRIMAL-DUAL ALGORITHM FOR THE ASSIGNMENT PROBLEMMCGINNIS LF.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 2; PP. 277-291; BIBL. 19 REF.Article

TWO ALGORITHMS FOR CONSTRAINED TWO-DIMENSIONAL CUTTING STOCK PROBLEMSWANG PY.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 3; PP. 573-586; BIBL. 4 REF.Article

OPTIMAL LOCATIONS ON A LINE ARE INTERLEAVED = LES LOCALISATIONS OPTIMALES SUR UNE LIGNE SONT INTERFOLIEESDENARDO EV; HUBERMAN G; ROTHBLUM UG et al.1982; OPER. RES.; ISSN 0030-364X; USA; DA. 1982; VOL. 30; NO 4; PP. 745-759; BIBL. 15 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

FACILITY LOCATIONS WITH THE L₁ METRIC IN THE PRESENCE OF BARRIERS TO TRAVELLARSON RC.1981; ISOLDE 81. INTERNATIONAL CONFERENCE ON LOCATIONAL DECISIONS. 2/1981/SKODSBORG; DNK; LYNGBY: IMSOR; DA. 1981; PP. 351-371; BIBL. 8 REF.Conference Paper

PROBLEME COMBINATOIRE DE POST AVEC DEUX COUPLES DE MOTSPAVLENKO VA.1981; DOKL.-AKAD. NAUK UKR. SSR, SER. A; ISSN 0201-8446; UKR; DA. 1981; NO 7; PP. 9-11; ABS. ENG; BIBL. 3 REF.Article

A FACILITY-LOCATION PROBLEMPANDIT SNN; DAS S.1981; J. MATH. & PHYS. SCI.; ISSN 0047-2557; IND; DA. 1981; VOL. 15; NO 3; PP. 209-224; BIBL. 15 REF.Article

ALGEBRAIC EPSILON K-ASSIGNMENT PROBLEMSGRYGIEL G.1981; CONTROL CYBERN.; ISSN 0324-8569; POL; DA. 1981; VOL. 10; NO 3-4; PP. 155-165; ABS. POL/RUS; BIBL. 8 REF.Article

FULL APPROXIMABILITY OF A CLASS OF PROBLEMS OVER POWERAUSIELLO G; MARCHETTI SPACCAMELA A; PROTASI M et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 76-87; BIBL. 8 REF.Conference Paper

HULL PROPERTIES IN LOCATION PROBLEMSJUEL H; LOVE RF.1981; ISOLDE 81. INTERNATIONAL CONFERENCE ON LOCATIONAL DECISIONS. 2/1981/SKODSBORG; DNK; LYNGBY: IMSOR; DA. 1981; PP. 303-312; BIBL. 5 REF.Conference Paper

FACILITY LOCATIONS WITH THE MANHATTAN METRIC IN THE PRESENCE OF BARRIERS TO TRAVELLARSON RC; SADIQ G.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 4; PP. 652-669; BIBL. 2 P.Article

A NOTE ON SOLVING MULTIFACILITY LOCATION PROBLEMS INVOLVING EUCLIDEAN DISTANCES = UNE NOTE SUR LA RESOLUTION DES PROBLEMES DE LOCALISATION DE PLUSIEURS CENTRES DE SERVICE COMPORTANT DES DISTANCES EUCLIDIENNESJUEL H.1982; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1982; VOL. 29; NO 1; PP. 179-180; BIBL. 4 REF.Article

FIXED POINT OPTIMALITY CRITERIA FOR THE LOCATION PROBLEM WITH ARBITRARY NORMSJUEL H; LOVE RF.1981; J. OPER. RES. SOC.; ISSN 0160-5682; GBR; DA. 1981; VOL. 32; NO 10; PP. 891-897; BIBL. 16 REF.Article

The combinatorics of authentication and secrecy codesSTINSON, D. R.Journal of cryptology. 1990, Vol 2, Num 1, pp 23-49, issn 0933-2790, 27 p.Article

HAMILTONIAN LOCATION PROBLEMSLAPORTE G; NOBERT Y; PELLETIER P et al.1983; EUROPEAN JOURNAL OF OPERATIONAL RESEARCH; ISSN 0377-2217; NLD; DA. 1983; VOL. 12; NO 1; PP. 82-89; BIBL. 28 REF.Article

OPTIMAL LOCATIONS FOR A CLASS OF NONLINEAR, SINGLE-FACILITY LOCATION PROBLEMS ON A NETWORKSHIER DR; DEARING PM.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 2; PP. 292-303; BIBL. 14 REF.Article

A FAST ALGORITHM FOR THE DECOMPOSITION OF GRAPHS AND POSETSBUER H; MOEHRING RH.1983; MATHEMATICS OF OPERATIONS RESEARCH; ISSN 0364-765X; USA; DA. 1983; VOL. 8; NO 2; PP. 170-184; BIBL. 40 REF.Article

LOCATING CENTRAL PATHS IN A GRAPHSLATER PJ.1982; TRANSP. SCI.; ISSN 0041-1655; USA; DA. 1982; VOL. 16; NO 1; PP. 1-18; BIBL. 21 REF.Article