Pascal and Francis Bibliographic Databases

Help

Search results

Your search

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

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 2562

  • Page / 103
Export

Selection :

  • and

ON FLOW SHOP SCHEDULING WITH RELEASE AND DUE DATES TO MINIMIZE MAXIMUM LATENESSGRABOWSKI J; SKUBALSKA E; SMUTNICKI C et al.1983; JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY; ISSN 0160-5682; GBR; DA. 1983; VOL. 34; NO 7; PP. 615-620; BIBL. 4 REF.Article

APPLYING NEW DOMINANCE CONCEPTS TO JOB SCHEDULE OPTIMIZATION = APPLICATION DE NOUVEAUX CONCEPTS DE DOMINANCE A L'OPTIMISATION DE L'ORDONNANCEMENT DE TACHESERSCHLER J; FONTAN G; MERCE C et al.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 1; PP. 60-66; BIBL. 7 REF.Article

A BASIS-CONSTRAINED LINEAR PROGRAMMING PROBLEM; ITS FORMULATION AND A BRANCH-AND-BOUND SOLUTION.TABATA K.1977; ELECTR. ENGNG JAP.; U.S.A.; DA. 1977; VOL. 97; NO 1; PP. 132-136; BIBL. 7 REF.Article

ORDONNANCEMENT DE LA PRODUCTION MINIMISANT LES TEMPS DE MONTAGE SUR DES MACHINES ALTERNATIVESHEPPES A; LUGOSI G.1976; ALKALMAZOTT MAT. LAPOK; MAGYAR.; DA. 1976; NO 1-2; PP. 83-91; ABS. ANGL.; BIBL. 2 REF.Article

SUR LA SOLUTION D'UNE CLASSE DE PROBLEMES DE LA THEORIE DE L'ORDONNANCEMENTSOVETOV B YA; TISHKIN AI.1976; IZVEST. VYSSH. UCHEBN. ZAVED., PRIBOROSTR.; S.S.S.R.; DA. 1976; VOL. 19; NO 12; PP. 56-60; BIBL. 3 REF.Article

AN IMPROVED BRANCH AND BOUND PROCEDURE FOR N X M FLOW SHOP PROBLEMS.PANWALKAR SS; KHAN AW.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 22; NO 4; PP. 787-790; BIBL. 13 REF.Article

AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHSSHORE ML; FOULDS LR; GIBBONS PB et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 323-333; BIBL. 18 REF.Article

BRANCH AND BOUND IN STATISTICAL DATA ANALYSISHAND DJ.1981; STATISTICIAN; ISSN 0039-0526; GBR; DA. 1981; VOL. 30; NO 1; PP. 1-13; BIBL. 7 REF.Article

SCHEDULING AND THE PROBLEM OF COMPUTATIONAL COMPLEXITYKING JR.1979; OMEGA; GBR; DA. 1979; VOL. 7; NO 3; PP. 233-240; BIBL. 15 REF.Article

THE CYCLIC SEPARATION SCHEDULING PROBLEM.ARMSTRONG RD; PRABHAKANT SINHA.1977; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1977; VOL. 24; NO 4; PP. 609-618; BIBL. 12 REF.Article

UEBER DIE ANWENDUNG DER METHODE DES BRANCH AND BOUND AUF DAS SUMMEN-ZUORDNUNGSPROBLEM. = SUR L'APPLICATION DE LA METHODE BRANCH AND BOUND AU PROBLEME D'AFFECTATION CLASSIQUESCHONLEIN A.1977; ANGEW. INFORMAT.; DTSCH.; DA. 1977; NO 12; PP. 547-552; ABS. ANGL.; BIBL. 16 REF.Article

A PLANT AND WAREHOUSE LOCATION PROBLEM.KAUFMAN L; VANDEN EEDE M; HANSEN P et al.1977; OPER. RES. QUART.; G.B.; DA. 1977; VOL. 28; NO 3I; PP. 547-554; BIBL. 16 REF.Article

A BRANCH AND BOUND ALGORITHM FOR USE IN RESOURCE ALLOCATION.KATSOULAS PC; SADOWSKI RP.1976; A.I.I.E. TRANS.; U.S.A.; DA. 1976; VOL. 8; NO 2; PP. 226-233; BIBL. 9 REF.Article

BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC PROGRAMMING.MORIN TL; MARSTEN RE.1976; OPER. RES.; U.S.A.; DA. 1976; VOL. 24; NO 4; PP. 611-627; BIBL. 2 P. 1/2Article

THE ONE-MACHINE SEQUENCING PROBLEM = LE PROBLEME D'ORDONNANCEMENT A UNE MACHINECARLIER J.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 1; PP. 42-47; BIBL. 9 REF.Article

IMPROVING COMPUTATIONAL EFFICIENCY IN TREE SEARCH METHODS FOR SCHEDULING: A STATISTICAL APPROACHKING J; SPACHIS A.1980; OMEGA (OXF.); ISSN 0305-0483; GBR; DA. 1980; VOL. 8; NO 6; PP. 655-660; BIBL. 17 REF.Article

PODZIAL I OGRANICZENIE JAKO METODA DEKOMPAZYCJI PROBLEMA WYZNACZANIA HARMONOGRAMU NA ROWNOLEGLYCH MASZYNACH = METHODE BRANCH AND BOUND EN TANT QUE METHODE DE DECOMPOSITION POUR DETERMINER LES ORDONNANCEMENTS SUR DES MACHINES PARALLELESPOTRZEBOWSKI H.1979; ARCH. AUTOMAT. TELEMECH.; POL; DA. 1979; VOL. 24; NO 2; PP. 301-313; ABS. POL/RUS; BIBL. 6 REF.Article

A BRANCH AND BOUND ALGORITHM FOR FEATURE SUBSET SELECTION.NARENDRA PM; FUKUNAGA K.1977; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1977; VOL. 26; NO 9; PP. 917-922; BIBL. 8 REF.Article

OPTIMIZATION OF SYSTEM RELIABILITY BY BRANCH-AND-BOUND.MCLEAVEY DW; MCLEAVEY JA.1976; I.E.E.E. TRANS. RELIABIL.; U.S.A.; DA. 1976; VOL. R-25; NO 5; PP. 327-329; BIBL. 8 REF.Article

A TRAVELLING SALESMAN PROBLEM: BRANCH AND BOUND TECHNIQUEKHARE AK; DAVE RK.1981; J. INSTIT. ENGRS (INDIA), MECH. ENGNG DIV.; IND; DA. 1981; VOL. 61; NO 4; PP. 121-125; BIBL. 4 REF.Article

THE SINGLE MACHINE PROBLEM WITH QUADRATIC PENALTY FUNCTION OF COMPLETION TIMES: A BRANCH- AND -BOUND SOLUTIONTOWNSEND W.1978; MANAG. SCI.; USA; DA. 1978; VOL. 24; NO 5; PP. 530-534; BIBL. 9 REF.Article

EXTENSIONS OF THE MULTI-PERIOD FACILITY PHASE-OUT MODEL: NEW PROCEDURES AND APPLICATION TO A PHASE-IN/PHASE-OUT PROBLEM.ROODMAN GM; SCHWARZ LB.1977; A.I.I.E. TRANS.; U.S.A.; DA. 1977; VOL. 9; NO 1; PP. 103-107; BIBL. 3 REF.Article

A NEW BOND FOR MACHINE SCHEDNLING.BESTWICK PF; HASTINGS NAJ.1976; OPER. RES. QUART.; G.B.; DA. 1976; VOL. 27; NO 2 PART. 2; PP. 479-487; BIBL. 11 REF.Article

LARGE SCALE DECISION TREE OPTIMIZATION BY BRANCH AND BOUND METHODSKAN CHEN; JARBOE KP.1980; LARGE SCALE SYSTEMS. THEORY AND APPLICATIONS. SYMPOSIUM ON LARGE SCALE SYSTEMS: THEORY AND APPLICATIONS. 2/1980/TOULOUSE; GBR/USA/FRA; OXFORD: PERGAMON PRESS/NEW YORK: PERGAMON PRESS/PARIS: PERGAMON PRESS; DA. 1980; PP. 339-348; BIBL. 11 REF.Conference Paper

REVERSED GEOMETRIC PROGRAMMING: A BRANCH-AND-BOUND METHOD INVOLVING LINEAR SUBPROBLEMSCOLE F; GOCHET W; VAN ASSCHE F et al.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 5; NO 1; PP. 26-35; BIBL. 15 REF.Article

  • Page / 103