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

Some new results concerning three counterfeit coins problemBOSNJAK, I.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 81-85, issn 0166-218XArticle

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

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

Local search heuristics for multi-index assignment problems with decomposable costsBANDELT, H-J; MAAS, A; SPIEKSMA, F. C. R et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 7, pp 694-704, issn 0160-5682, 11 p.Conference Paper

Asymptotic properties of random multidimensional assignment problemsGRUNDEL, D. A; OLIVEIRA, C. A. S; PARDALOS, P. M et al.Journal of optimization theory and applications. 2004, Vol 122, Num 3, pp 487-500, issn 0022-3239, 14 p.Article

Guided design search in the interval-bounded sailor assignment problemLEWIS, Mark W; LEWIS, Karen R; WHITE, Barbara J et al.Computers & operations research. 2006, Vol 33, Num 6, pp 1664-1680, issn 0305-0548, 17 p.Article

An efficient heuristic for series-parallel redundant reliability problemsYOU, Peng-Sheng; CHEN, Ta-Cheng.Computers & operations research. 2005, Vol 32, Num 8, pp 2117-2127, issn 0305-0548, 11 p.Article

A multi-period machine assignment problemXINHUI ZHANG; BARD, Jonathan F.European journal of operational research. 2006, Vol 170, Num 2, pp 398-415, issn 0377-2217, 18 p.Article

Additive rules in discrete allocation problemsBERGANTINOS, Gustavo; VIDAL-PUGA, Juan J.European journal of operational research. 2006, Vol 172, Num 3, pp 971-978, issn 0377-2217, 8 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

Trapezoidal matrices and the bottleneck assignment problemCECHLAROVA, K.Discrete applied mathematics. 1995, Vol 58, Num 2, pp 111-116, issn 0166-218XConference Paper

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

Strong regularity of matrices: a survey of resultsBUTKOVIC, P.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 45-68, issn 0166-218XArticle

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

THE QUADRATIC ASSIGNMENT PROBLEM: A BRIEF REVIEW.LAWLER EL.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 351-360; BIBL. 1 P. 1/2Conference Paper

LANG. ENGVAN EMDE BOAS P; VAN LEEUWEN J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 101-112; BIBL. 15 REF.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

Semi-automatic modeling by constraint acquisitionCOLETTA, Remi; BESSIERE, Christian; O'SULLIVAN, Barry et al.Lecture notes in computer science. 2003, pp 812-816, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

A Note on Parametric Analysis in Linear AssignmentVOLGENANT, A.Operations research. 2008, Vol 56, Num 2, pp 519-522, issn 0030-364X, 4 p.Article

Algorithms for wireless and ad-hoc networksBERTOSSI, Alan A; OLARIU, Stephan; PINOTTI, Cristina M et al.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 4, issn 0743-7315, 125 p.Serial Issue

Assigning cells to switches in mobile networks using an ant colony optimization heuristicFOURNIER, Joseph R. L; PIERRE, Samuel.Computer communications. 2005, Vol 28, Num 1, pp 65-73, issn 0140-3664, 9 p.Article