Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROBLEME PARTITIONNEMENT")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 12 of 12

  • Page / 1
Export

Selection :

  • and

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

ON THE SET-COVERING PROBLEM. II. AN ALGORITHM FOR SET PARTITIONING.BALAS E; PADBERG M.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 1; PP. 74-90; BIBL. 12 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

AN EFFECTIVE STRUCTURED APPROACH TO FINDING OPTIMAL PARTITIONS OF NETWORKSWIDJAJA H.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 3; PP. 241-262; ABS. GER; BIBL. 46 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

On the set partitioning type formulation for the discrete location problemDARZENTAS, J; BAIRAKTARIS, P.Computers & operations research. 1986, Vol 13, Num 6, pp 671-679, issn 0305-0548Article

SUBADDITIVE LIFTING METHODS FOR PARTITIONING AND KNAPSACK PROBLEMSJOHNSON EL.1980; J. ALGORITHMS; USA; DA. 1980; VOL. 1; NO 1; PP. 75-96; BIBL. 10 REF.Article

Randomized methods for the number partitioning problemARGÜELLO, M. F; FEO, T. A; GOLDSCHMIDT, O et al.Computers & operations research. 1996, Vol 23, Num 2, pp 103-111, issn 0305-0548Article

The nozzle guide vane problem: partitioning a heterogeneous inventoryANANTARAM BALAKRISHNAN; PLANTE, R; WONG, R et al.European journal of operational research. 1988, Vol 35, Num 3, pp 328-338, issn 0377-2217Article

Coloring sparse random graphs in polynomial average timeSUBRAMANIAN, C. R.Lecture notes in computer science. 2000, pp 415-426, issn 0302-9743, isbn 3-540-41004-XConference Paper

A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxationsMINOUX, M.RAIRO. Recherche opérationnelle. 1987, Vol 21, Num 2, pp 105-136, issn 0399-0559Article

Algorithmes connexionnistes pour les problèmes de routage et le problème de partitionnement = Connectionist algorithms for routing and partitionning problemsGHAZIRI, H; HASLER, M.Revue d'intelligence artificielle. 1997, Vol 11, Num 1, pp 59-72, issn 0992-499XArticle

  • Page / 1