Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("METHODE BRANCH AND BOUND")

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

Origin

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

Results 1 to 25 of 1138

  • Page / 46
Export

Selection :

  • and

COORDINATING AGGREGATE AND DETAILED SEHEDULING DECISIONS IN THE ONE-MACHINE JOB SHOP. I. THEORY.GELDERS L; KLEINDORFER PR.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 1; PP. 46-60; BIBL. 18 REF.Article

CONSTITUTION D'HORAIRES OPTIMAUX POUR LES PROCESSEURS FONCTIONNANT EN PARALLELELINSKIJ VS; KORNEV MD.1972; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S..R.; DA. 1972; NO 3; PP. 160-167; BIBL. 14 REF.Serial Issue

A BRANCH-AND-BOUND ALGORITHM FOR PAGINATION.DUNCAN J; SCOTT LW.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 240-259; BIBL. 10 REF.Article

ZUVERLAESSIGKEITSBETRACHTUNGEN VON NETZEN = FIABILITE DES RESEAUXHOEHNE G.1982; NACHRICHTENTECHNIK. ELEKTRONIK; ISSN 0323-4657; DDR; DA. 1982; VOL. 32; NO 9; PP. 386-387; BIBL. 5 REF.Article

SOLUTION D'UN PROBLEME D'ORDONNANCEMENT DANS UN CAS SPECIALGEROV G KH.1970; GOD. VISSH. TEKH. UCHEBN. ZAVED., MAT.; BALG.; DA. 1970; VOL. 6; NO 2; PP. 93-100; ABS. BULG. ALLEMSerial Issue

EIN BEITRAG ZU DEN REIHENFOLGEPROBLEMEN. = CONTRIBUTION A LA SOLUTION DES PROBLEMES D'ORDONNANCEMENT DES TACHESMANDEL R.1975; EKON.-MAT. OBZ.; CESKOSL.; DA. 1975; VOL. 11; NO 1; PP. 22-27; ABS. ANGL. TCHEQUE; BIBL. 4 REF.Article

LES PROCEDURES D'EXPLORATION ET D'OPTIMISATION PAR SEPARATION ET EVALUATION.HANSEN P.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 29-65; BIBL. DISSEM.Conference Paper

PROBLEMES COMBINATOIRES EXTREMAUX DE SYNTHESE DES RESEAUX DE COMMUTATIONPERSHIN O YU.1975; IN: UPR. MNOGOSVYAZNYMI SIST.; MOSKVA; NAUKA; DA. 1975; PP. 79-82; BIBL. 2 REF.Book Chapter

MINIMIZING MEAN FLOWTIME IN THE FLOW SHOP WITH NO INTERMEDIATE QUEUES.VAN DEMAN JM; BAKER KR.1974; A.I.I.E. TRANS.; U.S.A.; DA. 1974; VOL. 6; NO 1; PP. 28-34; BIBL. 5 REF.Article

EXPERIENCE SUR LA REALISATION DES ALGORITHMES D'ORGANISATION POUR LES SYSTEMES MULTIPROCESSEURSSHAKHBAZYAN KV; TUSHKINA TA; SOKHRANSKAYA VS et al.1975; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1975; NO 3; PP. 103-105; ABS. ANGL.; BIBL. 8 REF.Article

METHODE DE REPARTITION OPTIMALE DES TACHES DANS UN SYSTEME DE CALCUL HOMOGENEBARSKIJ AB.1974; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1974; NO 5; PP. 133-138; BIBL. 5 REF.Article

A BRANCH-AND-BOUND APPROACH TO THE JOB-SHOP SCHEDULING PROBLEMSAID ASHOUR; HIREMATH SR.1973; INTERNATION. J. PRODUCT. RES.; G.B.; DA. 1973; VOL. 11; NO 1; PP. 47-58; ABS. FR. ALLEM.; BIBL. 11 REF.Serial Issue

MINIMIZING TOTAL COSTS IN ONE-MACHINE SCHEDULING.KAN AHGR; LAGEWEG BJ; LENSTRA JK et al.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 5; PP. 908-927; BIBL. 1 P.Article

A BRANCH- AND BOUND ALGORITHM TO OBTAIN AN OPTIMAL EVALUATION TREE FOR MONOTONIC BOOLEAN FUNCTIONS.BREIBART YU; REITER A.1975; ACTA INFORMAT.; DTSCH.; DA. 1975; VOL. 4; NO 4; PP. 311-319; BIBL. 3 REF.Article

NUMERICAL INVESTIGATION OF OPTIMAL PARALLEL REDUNDANCY IN SERIES SYSTEMS.MCLEAVEY DW.1974; OPER. RES.; U.S.A.; DA. 1974; NO 5; PP. 1110-1117; BIBL. 10 REF.Article

GENERALISATION DU PROBLEME DU COMMIS VOYAGEURSOLICH R.1974; PRACE C.O. P.A.N.; POLSKA; DA. 1974; NO 141; PP. 1-29; ABS. ANGL. RUSSE; BIBL. 6 REF.Article

ON PARTITIONING THE FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEMGARFINKEL RS.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 340-343; BIBL. 2 REF.Serial Issue

THE USE OF CUTS IN COMPLEMENTARY PROGRAMMINGIBARAKI T.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 353-359; BIBL. 12 REF.Serial Issue

ALGORITHMES DE DETERMINATION DE LA CONFIGURATION OPTIMALE DE CERTAINS RESEAUX DE COMMUNICATIONMEEROV MV; PERSHIN O YU.1972; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1972; NO 8; PP. 132-142; ABS. ANGL.; BIBL. 3 REF.Serial Issue

BRANCH-AND-BOUND SEARCH FOR EXPERIMENTAL DESIGNS BASED ON D OPTIMALITY AND OTHER CRITERIAWELCH WJ.1982; TECHNOMETRICS; ISSN 0040-1706; USA; DA. 1982; VOL. 24; NO 1; PP. 41-48; BIBL. 17 REF.Article

A MULTI-COMMODITY FLOW NETWORK DESIGN PROBLEMFOULDS LR.1981; TRANSP. RES., PART B: METHODOL.; ISSN 0191-2615; GBR; DA. 1981; VOL. 15; NO 4; PP. 273-283; BIBL. 20 REF.Article

EIN BEZUEGLICH KERNSPEICHER- UND RECHENZEITBEDARF EFFIZIENTES BRANCH-UND-BOUND-VERFAHREN ZUR LOESUNG DES TRAVELLING-SALESMAN-PROBLEMS. = UN ALGORITHME BRANCH AND BOUND POUR RESOUDRE DES PROBLEMES DU COMMIS VOYAGEUR AVEC DES BESOINS EFFICACES DE STOCKAGE ET DE TEMPS D'ORDINATEURSCHONLEIN A.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; VOL. 18; NO 3; PP. 100-108; ABS. ANGL.; BIBL. 10 REF.Article

COORDINATING AGGREGATE AND DETAILED SCHEDULING IN THE ONE-MACHINE JOB-SHOP. II. COMPUTATION AND STRUCTURE.GELDERS L; KELINDORFER PR.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 312-324; BIBL. 5 REF.Article

SEQUENCING OF RELIABILITY TESTS.LOMNICKI ZA.1975; INTERNATION. J. PRODUCT. RES.; G.B.; DA. 1975; VOL. 13; NO 1; PP. 95-98; ABS. FR. ALLEM.; BIBL. 4 REF.Article

THE APPLICATION OF AUTOMATIC INTERACTION DETECTION (AID) IN OPERATIONAL RESEARCH.ABID ALI M; HICKMAN PJ; CLEMENTSON AT et al.1975; OPER. RES. QUART.; G.B.; DA. 1975; VOL. 26; NO 2; PP. 243-252; BIBL. 4 REF.Article

  • Page / 46