Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Méthode heuristique")


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

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


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

Author Country

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


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

Results 1 to 25 of 14755

  • Page / 591

Selection :

  • and

Implementating a loading heuristic in a discrete release job shopBOBROWSKI, P. M.International journal of production research. 1989, Vol 27, Num 11, pp 1935-1948, issn 0020-7543, 14 p.Article

A methodology for solving problems: problem modeling and heuristic generationIRANI, K. B; YOO, S. I.IEEE transactions on pattern analysis and machine intelligence. 1988, Vol 10, Num 5, pp 676-686, issn 0162-8828Article

The theory and practice of thinking outside the box: Interfacing abstractions with practical communication puzzlesMANNING, Alan.IEEE international professional communication conference. 2002, pp 544-551, isbn 0-7803-7591-2, 8 p.Conference Paper

Combining sets with elementsZARBA, Calogero G.Verification : theory and practice (essays dedicated to Zohar Manna on the occasion of this 64th birthday). Lecture notes in computer science. 2003, pp 762-782, issn 0302-9743, isbn 3-540-21002-4, 21 p.Book Chapter

A microcomputer based solution to a practical scheduling problemHODSON, A; MUHLEMANN, A. P; PRICE, D. H. R et al.The Journal of the Operational Research Society. 1985, Vol 36, Num 10, pp 903-914, issn 0160-5682Article

Reordering heuristics for routing in communications networksTOPKIS, D. M.Journal of applied probability. 1986, Vol 23, Num 1, pp 130-143, issn 0021-9002Article

The flow shop problem with a composite cost functionWOOLLAM, C. R; SAMBANDAM, N.Computers & industrial engineering. 1985, Vol 9, Num 1, pp 83-89, issn 0360-8352Article

On finding constrained minimum weight spanning subgraphsRAYWARD-SMITH, V. J.Engineering optimization. 1984, Vol 7, Num 4, pp 281-288, issn 0305-215XArticle

A practical and efficient method for compare-point matchingANASTASAKIS, Demos; DAMIANO, Robert; MA, Hi-Keung Tony et al.Design automation conference. 2002, pp 305-310, isbn 1-58113-461-4, 6 p.Conference Paper

The effectiveness of heuristic algorithms for multi-item inventory systems with joint replenishement costsKASPI, M; ROSENBLATT, M. J.International journal of production research. 1985, Vol 23, Num 1, pp 109-116, issn 0020-7543Article

A cyclical scheduling heuristic for lot sizing with capacity constraintsBAHL, H. C; RITZMAN, L. P.International journal of production research. 1984, Vol 22, Num 5, pp 791-800, issn 0020-7543Article

Flowshop with no idle machine time allowedWOOLLAM, C. R.Computers & industrial engineering. 1986, Vol 10, Num 1, pp 69-76, issn 0360-8352Article

On the refinement of bounds of heuristic algorithms for the traveling salesman problemJEROMIN, B; KÖRNER, F.Mathematical programming. 1985, Vol 32, Num 1, pp 114-117, issn 0025-5610Article

ADD-heuristics' starting procedures for capacitated plant location modelsDOMSCHKE, W; DREXL, A.European journal of operational research. 1985, Vol 21, Num 1, pp 47-53, issn 0377-2217Article

On prior distributions for binary trialsGEISSER, S.The American statistician. 1984, Vol 38, Num 4, pp 244-247, issn 0003-1305Article

Probabilistic analysis of bin packing heuristicsHOON LIONG ONG; MAGAZINE, M. J; WEE, T. S et al.Operations research. 1984, Vol 32, Num 5, pp 983-998, issn 0030-364XArticle

Augment-insert algorithms for the capacitated arc routing problemPEARN, W. L.Computers & operations research. 1991, Vol 18, Num 2, pp 189-198, issn 0305-0548, 10 p.Article

Heuristics for ray tracing using space subdivisionMACDONALD, J. D; BOOTH, K. S.The Visual computer. 1990, Vol 6, Num 3, pp 153-166, issn 0178-2789, 14 p.Article

A heuristic algorithm for the quadratic assignment formulation to the plant layout problemGOLANY, B; ROSENBLATT, M. J.International journal of production research. 1989, Vol 27, Num 2, pp 293-308, issn 0020-7543, 16 p.Article

Worst-case analysis of an approximation algorithm for flow-shop schedulingNOWICKI, E; SMUTNICKI, C.Operations research letters. 1989, Vol 8, Num 3, pp 171-177, issn 0167-6377, 7 p.Article

The importance of neutral mutations in GPGALVAN-LOPEZ, Edgar; RODRIGUEZ-VAZQUEZ, Katya.Lecture notes in computer science. 2006, pp 870-879, issn 0302-9743, isbn 3-540-38990-3, 1Vol, 10 p.Conference Paper

Productivity-based method for selecting the reservoir drilling target and steering strategyKHARGHORIA, A; CAKICI, M; NARAYANASAMY, R et al.Journal of petroleum technology. 2004, Vol 56, Num 5, pp 63-64, issn 0149-2136, 2 p.Conference Paper

Simultaneous row and column partitioning: Evaluation of a heuristicRITSCHARD, Gilbert; ZIGHED, Djamel A.Lecture notes in computer science. 2003, pp 468-472, issn 0302-9743, isbn 3-540-20256-0, 5 p.Conference Paper

That elusive diversity in classifier ensemblesKUNCHEVA, Ludmila I.Lecture notes in computer science. 2003, pp 1126-1138, issn 0302-9743, isbn 3-540-40217-9, 13 p.Conference Paper

Chronological decomposition heuristic for scheduling: Divide and conquer methodKELLY, Jeffrey Dean.AIChE journal. 2002, Vol 48, Num 12, pp 2995-2999, issn 0001-1541, 5 p.Article

  • Page / 591