Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Método 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 2262

  • Page / 91
Export

Selection :

  • and

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

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

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

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

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

A simulated annealing approach to scheduling a manufacturing cellVAKHARIA, A. J; YIH-LONG CHANG.Naval research logistics. 1990, Vol 37, Num 4, pp 559-577, issn 0894-069X, 19 p.Article

An exact solution method for the MTSPAHMAD HUSBAN.The Journal of the Operational Research Society. 1989, Vol 40, Num 5, pp 461-469, issn 0160-5682, 9 p.Article

Distributed implementation of a parallel branch and bound algorithm on a processor farmAUTHIE, G; ELKIHEL, M; VIADER, F et al.Strategem '96. Symposium. 1996, pp 171-186, isbn 2-7261-0982-9Conference Paper

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problemSPRECHER, A; KOLISCH, R; DREXL, A et al.European journal of operational research. 1995, Vol 80, Num 1, pp 94-102, issn 0377-2217Article

Improving the productivity of electroplating lines by changing the layout of the tanksVARNIER, C; GRUNDER, O; BAPTISTE, P et al.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 441-450, isbn 0-7803-2535-4, 3VolConference Paper

Adapting branch-and-bound for real-world scheduling problemsVASKO, F. J; WOLF, F. E; STOTT, K. L et al.The Journal of the Operational Research Society. 1993, Vol 44, Num 5, pp 483-490, issn 0160-5682Article

Dynamic programming state-space relaxation for single-machine schedulingABDUL-RAZAQ, T. S; POTTS, C. N.The Journal of the Operational Research Society. 1988, Vol 39, Num 2, pp 141-152, issn 0160-5682Article

Imprecise probabilities and their applicationsZAFFALON, Marco.International journal of approximate reasoning. 2005, Vol 39, Num 2-3, issn 0888-613X, 206 p.Conference Proceedings

A new approach to modeling and solving minimal perturbation problemsBARTAK, Roman; MÜLLER, Tomas; RUDOVA, Hana et al.Lecture notes in computer science. 2004, pp 233-249, issn 0302-9743, isbn 3-540-21834-3, 17 p.Conference Paper

Distributed Branch and Bound Algorithm in coalition planningBARTA, Jaroslav; STEPANKOVA, Olga; PECHOUCEK, Michal et al.Lecture notes in computer science. 2002, pp 159-168, issn 0302-9743, isbn 3-540-43377-5Conference Paper

Algorithm for optimal distribution of discrete nonuniform resources on a networkANISIMOV, V. G; ANISIMOV, E. G.Computational mathematics and mathematical physics. 1997, Vol 37, Num 1, pp 51-57, issn 0965-5425Article

Revisionsplanung unter Berücksichtigung wahrscheinlichkeitstheoretischer Aspekte = Revision planning from the point of view of theoretical probabilistic aspectsLUX, R; ALBIGER, J.VDI-Berichte. 1997, pp 101-117, issn 0083-5560, isbn 3-18-091352-5Conference Paper

A new node selection strategy in the branch-and-bound procedureCHING-JONG LIAO.Computers & operations research. 1994, Vol 21, Num 10, pp 1095-1101, issn 0305-0548Article

Adjustment of heads and tails for the job-shop problemCARLIER, J; PINSON, E.European journal of operational research. 1994, Vol 78, Num 2, pp 146-161, issn 0377-2217Conference Paper

The three-machine flow-shop problem with arbitrary precedence relationsCHONG JOHN LIM; MCMAHON, G. B.European journal of operational research. 1994, Vol 78, Num 2, pp 216-223, issn 0377-2217Conference Paper

A branch-and-bound algorithm for one class of scheduling problemANISIMOV, V. G; ANISIMOV, YE. G.Computational mathematics and mathematical physics. 1992, Vol 32, Num 12, pp 1827-1832, issn 0965-5425Article

A note on single machine scheduling: a comparison of two solution proceduresFRY, T. D; LEONG, G. K.Omega (Oxford). 1990, Vol 18, Num 1, pp 106-107, issn 0305-0483Article

  • Page / 91