Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("KNAPSACH PROBLEM")

Document Type [dt]

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

Publication Year[py]

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

Discipline (document) [di]

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

Language

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

Author Country

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

Results 1 to 25 of 216

  • Page / 9

Export

Selection :

  • and

HOW ITERATIVE TRANSFORMATIONS CAN HELP TO CRACK THE MERKLE-HELLMAN CRYPTOGRAPHIC SCHEMEDESMEDT Y; VANDEWALLE J; GOVAERTS R et al.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 21; PP. 910-911; BIBL. 4 REF.Article

ON PARALLEL COMPUTATION FOR THE KNAPSACK PROBLEMCHI CHIH YAO A.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 898-903; BIBL. 8 REF.Article

SUR UNE METHODE D'OPTIMISATION DE LA REPARTITION DES DONNEESPALAGIN AV; PISARSKIJ AV; POGORELYJ SD et al.1976; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1976; NO 4; PP. 54-58; BIBL. 5 REF.Article

OPTIMAL FILE ALLOCATION IN A COMPUTER NETWORK: A SOLUTION METHOD BASED ON THE KNAPSACK PROBLEMCERI S; MARTELLA G; PELAGATTI G et al.1982; COMPUTER NETWORKS; ISSN 0376-5075; NLD; DA. 1982; VOL. 6; NO 5; PP. 345-357; BIBL. 25 REF.Article

HEURISTIC ALGORITHMS FOR THE MULTIPLE KNAPSACK PROBLEMMARTELLO S; TOTH P.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 2; PP. 93-112; ABS. GER; BIBL. 5 REF.Article

EFFICIENT METHOD APPLYING INCOMPLETE ORDERING FOR SOLVING THE BINARY KNAPSACK PROBLEMBIRO M.1980; LECTURE NOTES CONTROL INFORM. SCI.; DEU; DA. 1980; NO 23; PP. 160-169; BIBL. 10 REF.Conference Paper

APPROXIMATE ALGORITHMS FOR SOME GENERALIZED KNAPSACK PROBLEMS.CHANDRA AK; HIRSCHBERG DS; WONG CK et al.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 293-304; BIBL. 8 REF.Article

THE MULTIPLE-CHOICE NESTED KNAPSACK MODELARMSTRONG RD; PRABHAKANT SINHA; ZOLTNERS AA et al.1982; MANAGE SCI.; ISSN 0025-1909; USA; DA. 1982; VOL. 28; NO 1; PP. 34-43; BIBL. 5 REF.Article

ON THE GROUP PROBLEM AND A SUBADDITIVE APPROACH TO INTEGER PROGRAMMINGJOHNSON EL.1979; DISCRETE OPTIMIZATION. ADVANCED RESEARCH INSTITUTE ON DISCRETE OPTIMIZATION AND SYSTEMS APPLICATIONS. DISCRETE OPTIMIZATION SYMPOSIUM/1977/BANFF ALBERTA-VANCOUVER B. C.; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1979; VOL. 2; PP. 97-112; BIBL. 10 REF.Conference Paper

SOLUTION APPROCHEE DU PROBLEME DE RESERVE OPTIMALE PAR LA METHODE DE PROGRAMMATION DYNAMIQUESHURA BURA A EH.1979; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1979; NO 4; PP. 39-44; BIBL. 2 REF.Article

FACETS OF THE KNAPSACK POLYTOPE FROM MINIMAL COVERS.BALAS E; ZEMEL E.1978; S.I.A.M.J. APPL. MATH.; U.S.A.; DA. 1978; VOL. 34; NO 1; PP. 119-148; BIBL. 16 REF.Article

LONG DIVISION: AN EXAMPLE OF WHEN THE GREEDY ALGORITHM SOLVES A KNAPSACK PROBLEM.MAGAZINE MJ; NUTTLE HLW.1976; A.I.I.E. TRANS.; U.S.A.; DA. 1976; VOL. 8; NO 2; PP. 283-285; BIBL. 3 REF.Article

DYNAMIC BIN PACKINGCOFFMAN EG JR; GAREY MR; JOHNSON DS et al.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 227-258; BIBL. 5 REF.Article

COMPUTING LOW-CAPACITY 0-1 KNAPSACK POLYTOPESHAMMER PL; PELED UN.1982; Z. OPER. RES.; ISSN 0373-790X; DEU; DA. 1982; VOL. 26; NO 7; PP. 243-249; ABS. GER; BIBL. 12 REF.Article

ON THE PARALLEL COMPUTATION FOR THE KNAPSACK PROBLEMCHI CHIH YAO A.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 123-127; BIBL. 8 REF.Conference Paper

APPROXIMATION ALGORITHMS FOR CERTAIN SCHEDULING PROBLEMSIBARRA OH; KIM CE.1978; MATH. OPER. RES.; USA; DA. 1978; VOL. 3; NO 3; PP. 197-204; BIBL. 10 REF.Article

ANALYSE DE SENSIBILITE DES SOLUTIONS DU PROBLEME SAC A DOSLIBURA M.1977; ARCH. AUTOMAT. TELEMECH.; POLSKA; DA. 1977; VOL. 22; NO 3; PP. 313-322; ABS. RUSSE ANGL.; BIBL. 3 REF.Article

EXPONENTIAL LOWER BOUNDS ON A CLASS OF KNAPSACK ALGORITHMSHAUSMANN D; RAVINDRAN KANNAN; KORTE B et al.1981; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1981; VOL. 6; NO 2; PP. 225-232; BIBL. 8 REF.Article

THE MULTIPERIOD KNAPSACK PROBLEM = LE PROBLEME DU SAC A DOS A PLUSIEURS PERIODESFAALAND BH.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 3; PP. 612-616; BIBL. 3 REF.Article

A NONLINEAR LOWER BOUND ON LINEAR SEARCH TREE PROGRAMS FOR SOLVING KNAPSACK PROBLEMS.DOBKIN D.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 1; PP. 69-73; BIBL. 4 REF.Article

METHODE DE RESOLUTION DU PROBLEME DU SAC A DOSVELIEV GP; MAMEDOV K SH.1981; Z. VYCISL. MAT. MAT. FIZ.; ISSN 0044-4669; SUN; DA. 1981; VOL. 21; NO 3; PP. 605-611; BIBL. 11 REF.Article

BEMERKUNG ZU EINER ARBEIT VON ACHON UEBER DIE ANZAHL ZULAESSIGER LOESUNGEN EINES KNAPSACK-PROBLEMS = REMARQUES SUR UN TRAVAIL DE ACHOU SUR LE CALCUL DES SOLUTIONS REALISABLES D'UN PROBLEME DE SAC A DOSPIEHLER J.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1978; VOL. 9; NO 2; PP. 167-170; ABS. ENG/RUS; BIBL. 1 REF.Article

SUR UN ALGORITHME AVEC ESTIMATION POUR LA RESOLUTION DE QUELQUES PROBLEMES DE PROGRAMMATION MATHEMATIQUEGVOZDEV SE.1978; UPRAVL. SISTEMY; SUN; DA. 1978; NO 17; PP. 28-45; BIBL. 10 REF.Article

A GENERAL ALGORITHM FOR ONE-DIMENSIONAL KNAPSACK PROBLEMS.INGARGIOLA GP; KORSH JF.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 5; PP. 752-759; BIBL. 4 REF.Article

CANONICAL COIN CHANGING AND GREEDY SOLUTIONS.CHANG L; KORSH JF.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 3; PP. 418-422; BIBL. 3 REF.Article

  • Page / 9