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

Some branch-and-bound procedures for fixed-cost transportation problemsCABOT, A. V; ERENGUE, S. S.Naval research logistics quarterly. 1984, Vol 31, Num 1, pp 145-154, issn 0028-1441Article

Specially structured precedence constraints in three-dimensional bottleneck assignment problemsVARTAK, M. N; GEETHA, S.The Journal of the Operational Research Society. 1990, Vol 41, Num 4, pp 339-344, issn 0160-5682, 6 p.Article

Grasping optimization using a required external force setWATANABE, Tetsuyou; YOSHIKAWA, Tsuneo.IEEE transactions on automation science and engineering. 2007, Vol 4, Num 1, pp 52-66, issn 1545-5955, 15 p.Article

Single-machine scheduling to minimize absolute deviation of completion times from a common due dateSZWARC, W.Naval research logistics. 1989, Vol 36, Num 5, pp 663-673, issn 0894-069X, 11 p.Article

Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine = A new dominance concept for job shop scheduling using a single machineERSCHLER, J; FONTAN, G; MERCE, C et al.RAIRO. Recherche opérationnelle. 1985, Vol 19, Num 1, pp 15-26, issn 0399-0559Article

Règle complémentaire de section pour la méthode arborescenteVENIAMINOV, S. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 59-63, issn 0002-3388Article

Synthesis of optimal and near-optimal distillation sequences by a bounding strategyPIBOULEAU, L; SAID, A; DOMENECH, S et al.Chemical engineering journal. 1983, Vol 27, Num 1, pp 9-19, issn 0300-9467Article

Sensitivity analysis for branch and bound integer programmingSCHRAGE, L; WOLSEY, L.Operations research. 1985, Vol 33, Num 5, pp 1008-1023, issn 0030-364XArticle

A branch and bound algorithm for assembly line balancing problems with formulation irregularitiesJOHNSON, R. V.Management science. 1983, Vol 29, Num 11, pp 1309-1324, issn 0025-1909Article

Evaluation of a branch and bound algorithm for clusteringDIEHR, G.SIAM journal on scientific and statistical computing. 1985, Vol 6, Num 2, pp 268-284, issn 0196-5204Article

A branch and bound algorithm for the total weighted tardiness problemPOTTS, C. N; VAN WASSENHOVE, L. N.Operations research. 1985, Vol 33, Num 2, pp 363-377, issn 0030-364XArticle

A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion timePOTTS, C. N.Management science. 1985, Vol 31, Num 10, pp 1300-1311, issn 0025-1909Article

Multiobjective Control Structure Design: A Branch and Bound ApproachKARIWALA, Vinay; YI CAO.Industrial & engineering chemistry research. 2012, Vol 51, Num 17, pp 6064-6070, issn 0888-5885, 7 p.Article

The best subset of parameters in min-max linear regressionARMSTRONG, R. D; BECK, P. O.Communications in statistics. Simulation and computation. 1986, Vol 15, Num 1, pp 263-270, issn 0361-0918Article

A branch and bound algorithm for extreme point mathematical programming problemsSEN, S; SHERALI, H. D.Discrete applied mathematics. 1985, Vol 11, Num 3, pp 265-280, issn 0166-218XArticle

Zero- one integer programs with few constraints-efficient branch and bound algorithmsGAVISH, B; PIRKUL, H.European journal of operational research. 1985, Vol 22, Num 1, pp 35-43, issn 0377-2217Article

General branch and bound, and its relation to A and AONAU, D. S; KUMAR, V; KANAL, L et al.Artificial intelligence. 1984, Vol 23, Num 1, pp 29-58, issn 0004-3702Article

An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtimeSARIN, S. C; AHN, S; BISHOP, A. B et al.International journal of production research. 1988, Vol 26, Num 7, pp 1183-1191, issn 0020-7543Article

Scheduling jobs with release dates and tails on identical machines to minimize the makespanCARLIER, J.European journal of operational research. 1987, Vol 29, Num 3, pp 298-306, issn 0377-2217Article

Scheduling tasks with sequence-dependent processing timesBIANCO, L; RICCIARDELLI, S; RINALDI, G et al.Naval research logistics. 1988, Vol 35, Num 2, pp 177-184, issn 0894-069XArticle

The fixed job schedule problem with spread-time constraintsFISCHETTI, M; MARTELLO, S; TOTH, P et al.Operations research. 1987, Vol 35, Num 6, pp 849-858, issn 0030-364XArticle

Une procédure arborescente pour la séparation de mélanges complexes dans l'industrie chimique. Application à un train de colonnes de rectification = Branch and bound procedure for multicomponent mixtures separation in chemical industry. Application to a rectification columns sequencePIBOULEAU, L; DOMENECH, S.RAIRO. Recherche opérationnelle. 1985, Vol 19, Num 1, pp 35-56, issn 0399-0559Article

On scheduling with ready times to minimize mean flow timeDEOGUN, J. S.Computer journal (Print). 1983, Vol 26, Num 4, pp 320-328, issn 0010-4620Article

Sequencing with setup time and order tardiness trade-offsLIAO, C.-J; CHUANG, C.-H.Naval research logistics. 1996, Vol 43, Num 7, pp 971-984, issn 0894-069XArticle

Optimal tour planning with specified nodesLAPORTE, G; MERCURE, H; NOBERT, Y et al.RAIRO. Recherche opérationnelle. 1984, Vol 18, Num 3, pp 203-210, issn 0399-0559Article

  • Page / 103