Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problema asignación")

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

Results 1 to 25 of 471

  • Page / 19
Export

Selection :

  • and

A hybrid genetic algorithm and application to the crosstalk aware track assignment problemYICI CAI; BIN LIU; XIONG YAN et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 181-184Conference Paper

Assignment problems : A golden anniversary surveyPENTICO, David W.European journal of operational research. 2007, Vol 176, Num 2, pp 774-793, issn 0377-2217, 20 p.Article

LP relaxations of multiple all―different predicatesAPPA, Gautam; MAGOS, Dimitris; MOURTOS, Ioannis et al.Lecture notes in computer science. 2004, pp 364-369, issn 0302-9743, isbn 3-540-21836-X, 6 p.Conference Paper

A (1-1/e)-approximation algorithm for the generalized assignment problemNUTOV, Zeev; BENIAMINY, Israel; YUSTER, Raphael et al.Operations research letters. 2006, Vol 34, Num 3, pp 283-288, issn 0167-6377, 6 p.Article

An addendum on sensitivity analysis of the optimal assignmentVOLGENANT, A.European journal of operational research. 2006, Vol 169, Num 1, pp 338-339, issn 0377-2217, 2 p.Article

Projecting the flow variables for hub location problemsLABBE, Martine; YAMAN, Hande.Networks (New York, NY). 2004, Vol 44, Num 2, pp 84-93, issn 0028-3045, 10 p.Article

An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networksMANDAL, Swarup; SAHA, Debashis; BERA, Sougata et al.Lecture notes in computer science. 2003, pp 350-360, issn 0302-9743, isbn 3-540-20745-7, 11 p.Conference Paper

Address assignment combined with scheduling in DSP code generationCHOI, Yoonseo; KIM, Taewhan.Design automation conference. 2002, pp 225-230, isbn 1-58113-461-4, 6 p.Conference Paper

How *not* to solve a SudokuGABOR, Adriana F; WOEGINGER, Gerhard J.Operations research letters. 2010, Vol 38, Num 6, pp 582-584, issn 0167-6377, 3 p.Article

Compounded genetic algorithms for the quadratic assignment problemDREZNER, Zvi.Operations research letters. 2005, Vol 33, Num 5, pp 475-480, issn 0167-6377, 6 p.Article

Cooperative. Task Assignment/Path Planning of Multiple Unmanned Aerial Vehicles Using Genetic AlgorithmsEUN, Yeonju; BANG, Hyochoong.Journal of aircraft. 2009, Vol 46, Num 1, pp 338-343, issn 0021-8669, 6 p.Article

Application of Monkey Search Meta-heuristic to Solving Instances of the Multidimensional Assignment ProblemKAMMERDINER, Alla R; MUCHERINO, Antonio; PARDALOS, Panos M et al.Lecture notes in control and information sciences. 2009, Vol 381, pp 385-397, issn 0170-8643, isbn 978-3-540-88062-2 3-540-88062-3, 1Vol, 13 p.Conference Paper

A branch and cut algorithm for hub location problems with single assignmentLABBE, Martine; YAMAN, Hande; GOURDIN, Eric et al.Mathematical programming. 2005, Vol 102, Num 2, pp 371-405, issn 0025-5610, 35 p.Article

An Auction algorithm for graph-based contextual correspondence MatchingVAN WYK, Barend J; VAN WYK, Michaël A; NOEL, Guillaume et al.Lecture notes in computer science. 2004, pp 334-342, issn 0302-9743, isbn 3-540-22570-6, 9 p.Conference Paper

A Lagrangian bound for many-to-many assignment problemsLITVINCHEV, Igor; RANGEL, Socorro; SAUCEDO, Jania et al.Journal of combinatorial optimization. 2010, Vol 19, Num 3, pp 241-257, issn 1382-6905, 17 p.Conference Paper

An algorithm for ranking assignments using reoptimizationPEDERSEN, Christian Roed; NIELSEN, Lars Relund; ANDERSEN, Kim Allan et al.Computers & operations research. 2008, Vol 35, Num 11, pp 3714-3726, issn 0305-0548, 13 p.Article

Inverse constrained bottleneck problems under weighted l normXIUCUI GUAN; JIANZHONG ZHANG.Computers & operations research. 2007, Vol 34, Num 11, pp 3243-3254, issn 0305-0548, 12 p.Article

Partial inverse assignment problems under l1 normXIAOGUANG YANG; JIANZHONG ZHANG.Operations research letters. 2007, Vol 35, Num 1, pp 23-28, issn 0167-6377, 6 p.Article

The stable set problem and the thinness of a graphMANNINO, Carlo; ORIOLO, Gianpaolo; RICCI, Federico et al.Operations research letters. 2007, Vol 35, Num 1, pp 1-9, issn 0167-6377, 9 p.Article

Avoiding error-prone reordering optimization during legal systems migrationYOULIN FANG; HENG WANG; DONGQING YANG et al.Lecture notes in computer science. 2005, pp 34-43, issn 0302-9743, isbn 3-540-28566-0, 10 p.Conference Paper

PCB assembly optimization of chip mounters for multiple feeder assignmentKIM, Kyung-Min; PARK, Tae-Hyoung.SICE annual conference. 2004, pp 1425-1430, isbn 4-907764-22-7, 3Vol, 6 p.Conference Paper

Multi-objective integer programming: A general approach for generating all non-dominated solutionsÖZLEN, Melih; AZIZOGLU, Meral.European journal of operational research. 2009, Vol 199, Num 1, pp 25-35, issn 0377-2217, 11 p.Article

A branch-and-bound algorithm for the singly constrained assignment problemLIESHOUT, P. M. D; VOLGENANT, A.European journal of operational research. 2007, Vol 176, Num 1, pp 151-164, issn 0377-2217, 14 p.Article

Truck dock assignment problem with operational time constraint within crossdocksLIM, Andrew; HONG MA; ZHAOWEI MIAO et al.Lecture notes in computer science. 2006, pp 262-271, issn 0302-9743, isbn 3-540-35453-0, 1Vol, 10 p.Conference Paper

Inverse constrained bottleneck problems on networksXIUCUI GUAN; JIANZHONG ZHANG.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part IV, 161-171Conference Paper

  • Page / 19