The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

An asymptotically exact polynomial algorithm for equipartition problemsSIMEONE, B.Discrete applied mathematics. 1986, Vol 14, Num 3, pp 282-293, issn 0166-218XArticle

Linearized simplicial decomposition methods for computing traffic equilibria on networksJONG-SHI PANG; CHANG-SUNG YU.Networks (New York, NY). 1984, Vol 14, Num 3, pp 427-438, issn 0028-3045Article

PARALLEL LINE ASSIGNMENT PROBLEMSKLEIN M; TAKAMORI H.1972; MANAG. SCI.; U.S.A.; DA. 1972; VOL. 19; NO 1; PP. 1-10; BIBL. 4 REF.Serial Issue

THE QUADRATIC ASSIGNMENT PROBLEM: A BRIEF REVIEW.LAWLER EL.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 351-360; BIBL. 1 P. 1/2Conference Paper

AN EXTENTION OF THE (SZWARC) TRUCK ASSIGNMENT PROBLEMBELLMORE M; LIEBMAN JC; MARKS DH et al.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 19; NO 1; PP. 91-99; BIBL. 6 REF.Serial Issue

PRE-PARTITIONING AS A MEANS OF ENHANCING PAIRWISE INTER CHANGE SOLUTIONS TO QUADRATIC ASSIGNMENT PROBLEMS.PATEL AM; DE WALD CG; COTE LC et al.1976; COMPUTERS OPER. RES.; G.B.; DA. 1976; VOL. 3; NO 1; PP. 49-56; BIBL. 5 REF.Article

A HEURISTIC ALGORITHM FOR THE VEHICLE-DISPATCH PROBLEM.GILLETT BE; MILLER LR.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 340-349; BIBL. 14 REF.Article

A SIMPLE METHOD OF ASSIGNING PROJECTS TO STUDENTSPROLL LG.1972; OPER. RES. QUART.; G.B.; DA. 1972; VOL. 23; NO 2; PP. 195-201; BIBL. 6 REF.Serial Issue

ANALYSIS OF THE MODULE ASSIGNMENT PROBLEM IN DISTRIBUTED COMPUTING SYSTEMS WITH LIMITED STORAGEARORA RK; RANA SP.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 3; PP. 111-115; BIBL. 5 REF.Article

HEURISTISCHE LOESUNGSVERFAHREN FUER LIEFERPLANPROBLEME. = METHODES DE RESOLUTION HEURISTIQUE POUR DES PROBLEMES D'ORDONNANCEMENT DE VEHICULESMATTHAUS FW.1975; Z. OPER. RES.; DTSCH.; DA. 1975; VOL. 19; NO 5; PP. 163-181; ABS. ANGL.; BIBL. 2 P. 1/2Article

OPTIMAL SEQUENTIAL ASSIGNMENTS WITH RANDOM ARRIVAL TIMES.ALBRIGHT SC.1974; MANAG. SCI.; U.S.A.; DA. 1974; VOL. 21; NO 1; PP. 60-67; BIBL. 3 REF.Article

THE ASSIGNMENT OF STUDENTS TO SCHOOL BRANCHES OF A DIFFERENTIATED SCHOOL SYSTEM. A STUDY OF SOME STRATEGIES BY MEANS OF SIMULATION.BEDALL FK; ZIMMERMANN H.1974; IN: COMPSTAT 1974. PROC. COMPUT. STAT.; VIENNA; 1974; WIEN; RUDOLF LIEBING; DA. 1974; PP. 269-286; BIBL. 4 REF.Conference Paper

A sequential stochastic assignment problem in a partially observable Markov chainNAKAI, T.Mathematics of operations research. 1986, Vol 11, Num 2, pp 230-240, issn 0364-765XArticle

Improving the Hungarian assignment algorithmJONKER, R; VOLGENANT, T.Operations research letters. 1986, Vol 5, Num 4, pp 171-175, issn 0167-6377Article

MULTIPATH TRAFFIC ASSIGNMENT WITH DYNAMIC INPUT FLOWS.ROBILLARD P.1974; TRANSPORT. RES.; G.B.; DA. 1974; VOL. 8; NO 6; PP. 567-573; BIBL. 6 REF.Article

AN N-STEP, 2-VARIABLE SEARCH ALGORITHM FOR THE COMPONENT PLACEMENT PROBLEM.HEIDER CH.1974; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1974; VOL. 20; NO 4; PP. 699-724; BIBL. 15 REF.Article

Additive rules in discrete allocation problemsBERGANTINOS, Gustavo; VIDAL-PUGA, Juan J.European journal of operational research. 2006, Vol 172, Num 3, pp 971-978, issn 0377-2217, 8 p.Article

A GRAPH THEORETIC ANALYSIS OF BOUNDS FOR THE QUADRATIC ASSIGNMENT PROBLEMCHRISTOFIDES N; GERRARD M.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 61-68; BIBL. 14 REF.Conference Paper

THE MULTIPLE ASSIGNMENT STATEMENT.GRIES D.1978; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1978; VOL. 4; NO 2; PP. 89-93; BIBL. 5 REF.Article

HEURISTISCHE VERFAHREN ZUR LOESUNG QUADRATISCHER ZUORDNUNGSPROBLEME. = METHODES HEURISTIQUES POUR LA RESOLUTION DE PROBLEMES D'AFFECTATION QUADRATIQUEBURKARD RE.1975; Z. OPER. RES.; DTSCH.; DA. 1975; VOL. 19; NO 5; PP. 183-193; ABS. ANGL.; BIBL. 2 P.Article

COMPUTER SCHEDULING OF VEHICLES FROM ONE OR MORE DEPOTS TO A NUMBER OF DELIVERY POINTSWREN A; HOLLIDAY A.1972; OPER. RES. QUART.; G.B.; DA. 1972; VOL. 23; NO 3; PP. 333-344; BIBL. 7 REF.Serial Issue

K-CLASS ASSIGNMENTSTAPIERO CS.1972; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., V; FR.; DA. 1972; VOL. 6; PP. 41-44; BIBL. 4 REF.Serial Issue

OPERATING CHARACTERISTICS OF A SIMPLE SHUTTLE UNDER LOCAL DISPATCHING RULESIGNALL E; KOLESAR P.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 6; PP. 1077-1088; BIBL. 10 REF.Serial Issue

L'AFFECTATION EXPONENTIELLE ET LE PROBLEME DU PLUS COURT CHEMIN DANS UN GRAPHE.FONLUPT J.sdIN: SEMIN. ANAL. NUMER. ANNEE 1976-1977. 2E SEMEST., GRENOBLE; 1977; S.L.; DA. S.D.; PP. 275.1-275.36; BIBL. 8 REF.Conference Paper