Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Méthode séparation et évaluation")

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

Results 1 to 25 of 1603

  • Page / 65

Selection :

  • and

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

A Bayesian probabilistic approach for structure damage detectionSOHN, H; LAW, K. H.Earthquake engineering & structural dynamics. 1997, Vol 26, Num 12, pp 1259-1281, issn 0098-8847Article

Combined Branch and Bound Method and Exergy Analysis for Energy System DesignHARTONO, Benny; HEIDEBRECHT, Peter; SUNDMACHER, Kai et al.Industrial & engineering chemistry research. 2012, Vol 51, Num 44, pp 14428-14437, issn 0888-5885, 10 p.Article

A comparison of consistency propagation algorithms in constraint optimizationJINGFANG ZHENG; HORSCH, Michael C.Lecture notes in computer science. 2003, pp 160-174, issn 0302-9743, isbn 3-540-40300-0, 15 p.Conference Paper

Solving hybrid flow shop problem using energetic reasoning and global operationsNERON, Emmanuel; BAPTISTE, Philippe; GUPTA, Jatinder N. D et al.Omega (Oxford). 2001, Vol 29, Num 6, pp 501-511, issn 0305-0483Article

Application of branch and bound method in divided line balancing problemKURASHIGE, K; YANAGAWA, Y; MIYAZAKI, S et al.International journal of the Japan Society for Precision Engineering. 1998, Vol 32, Num 2, pp 137-143, issn 0916-782XArticle

Branch and Bound methods for a search problemWASHBURN, A. R.Naval research logistics. 1998, Vol 45, Num 3, pp 243-257, issn 0894-069XArticle

A scheduling system to achieve just-in-time production and minimum changeover counts in a polymerization plantTAKEDA, Kazuhiro; TANAKA, Akihito; TSUGE, Yoshifumi et al.Journal of chemical engineering of Japan. 2004, Vol 37, Num 9, pp 1135-1139, issn 0021-9592, 5 p.Article

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

Generating all efficient solutions of a rescheduling problem on unrelated parallel machinesÖZLEN, Melih; AZIZOGLU, Meral.International journal of production research. 2009, Vol 47, Num 19, pp 5245-5270, issn 0020-7543, 26 p.Article

Minimum recombination histories by branch and boundLYNGSØ, Rune B; SONG, Yun S; HEIN, Jotun et al.Lecture notes in computer science. 2005, pp 239-250, issn 0302-9743, isbn 3-540-29008-7, 1Vol, 12 p.Conference Paper

Méthode exacte pour les problèmes d'ordonnancement avec délais de communication = A branch and bound algorithm for scheduling problem with communication delaysDaddi Moussa, Ahmed; Chretienne, Phillippe.1997, 94 p.Thesis

On Accuracy, Privacy and Complexity in the Identification ProblemBEEKHOF, F; VOLOSHYNOVSKIY, S; KOVAL, O et al.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7540, issn 0277-786X, isbn 978-0-8194-7933-4 0-8194-7933-0, 1Vol, 754017.1-754017.8Conference Paper

Un algorithme d'ordonnancement multi-cyclique d'un robot = A multicyclic scheduling algorithm of a robotCHE, Ada; FEND CHU; CHENGBIN CHU et al.MOSIM '01 : conference francophone de modélisation et simulation. 2001, isbn 1-56555-212-1, 3Vol, V1, 385-390Conference Paper

New separation scheme for hybrid flowshopDUPONT, L; VIGNIER, A; PORTMANN, M.-C et al.Journal européen des systèmes automatisés. 1998, Vol 32, Num 4, pp 453-465, issn 1269-6935Article

Improved lower bounds for the early/tardy scheduling problem with no idle timeVALENTE, J. M. S; ALVES, R. A. F. S.The Journal of the Operational Research Society. 2005, Vol 56, Num 5, pp 604-612, issn 0160-5682, 9 p.Article

Inference in credal networks : branch-and-bound methods and the A/R+ algorithmFERREIRA DA ROCHA, José Carlos; GAGLIARDI COZMAN, Fabio.International journal of approximate reasoning. 2005, Vol 39, Num 2-3, pp 279-296, issn 0888-613X, 18 p.Conference Paper

Selected works presented at the International Workshop on Interval Mathematics and Constraint Propagation Methods, June 23-24, 2004, Akademgorodok, Novorsibirsk, RussiaSHARY, Sergey P.Reliable computing. 2005, Vol 11, Num 5, issn 1385-3139, 124 p.Conference Proceedings

Exploiting unit propagation to compute lower bounds in branch and bound max-SAT solversCHU MIN LI; MANYA, Felip; PLANES, Jordi et al.Lecture notes in computer science. 2005, pp 403-414, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 12 p.Conference Paper

On decidability of MSO theories of representable matroidsHLINENY, Petr; SEESE, Detlef.Lecture notes in computer science. 2004, pp 96-107, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

A Max-SAT solver with lazy data structuresALSINET, Teresa; MANYA, Felip; PLANES, Jordi et al.Lecture notes in computer science. 2004, pp 334-342, issn 0302-9743, isbn 3-540-23806-9, 9 p.Conference Paper

  • Page / 65