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

Addressing capacity uncertainty in resource-constrained assignment problemsTOKTAS, Berkin; YEN, Joyce W; ZABINSKY, Zelda B et al.Computers & operations research. 2006, Vol 33, Num 3, pp 724-745, issn 0305-0548, 22 p.Article

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

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

Random assignment problemsKROKHMAL, Pavlo A; PARDALOS, Panos M.European journal of operational research. 2009, Vol 194, Num 1, pp 1-17, issn 0377-2217, 17 p.Article

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

A doubly cyclic channel assignment problemMCDIARMID, C.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 263-268, issn 0166-218XArticle

Recent advances in the solution of quadratic assignment problemsANSTREICHER, Kurt M.Mathematical programming. 2003, Vol 97, Num 1-2, pp 27-42, issn 0025-5610, 16 p.Article

A Markov chain model for traffic equilibrium problemsMASTROENI, Giandomenico.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 3, pp 209-226, issn 0399-0559, 18 p.Article

Asymptotic behavior of the expected optimal value of the multidimensional assignment problemKROKHMAL, Pavlo A; GRUNDEL, Don A; PARDALOS, Panos M et al.Mathematical programming. 2007, Vol 109, Num 2-3, pp 525-551, issn 0025-5610, 27 p.Conference Paper

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 Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problemPARK, J. S; BYUNG HA LIM; YOUNGHO LEE et al.Management science. 1998, Vol 44, Num 12, pp S271-S282, issn 0025-1909, 2Article

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

Robust Capacity Assignment Solutions for Telecommunications Networks with Uncertain DemandsBABONNEAU, F; VIAL, J.-P; KLOPFENSTEIN, O et al.Networks (New York, NY). 2013, Vol 62, Num 4, pp 255-272, issn 0028-3045, 18 p.Article

An improved origin-based algorithm for solving the combined distribution and assignment problemMENG XU; CHEN, Anthony; ZIYOU GAO et al.European journal of operational research. 2008, Vol 188, Num 2, pp 354-369, issn 0377-2217, 16 p.Article

An assignment model for dynamic load planning of intermodal trainsCONY, Paul; KOZAN, Erhan.Computers & operations research. 2006, Vol 33, Num 1, pp 1-17, issn 0305-0548, 17 p.Article

On the robust assignment problem under a fixed number of cost scenariosDEIINEKO, Vladimir G; WOEGINGER, Gerhard J.Operations research letters. 2006, Vol 34, Num 2, pp 175-179, issn 0167-6377, 5 p.Article

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

Determining Type II sensitivity ranges of the fractional assignment problemLIN, Chi-Jen.Operations research letters. 2011, Vol 39, Num 1, pp 67-73, issn 0167-6377, 7 p.Article

A modified method for solving the unbalanced assignment problemsKUMAR, Avanish.Applied mathematics and computation. 2006, Vol 176, Num 1, pp 76-82, issn 0096-3003, 7 p.Article

Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicleBUKCHIN, Yossi; SARIN, Subhash C.European journal of operational research. 2006, Vol 174, Num 2, pp 1329-1337, issn 0377-2217, 9 p.Article

The minimum cost perfect matching problem with conflict pair constraintsÖNCAN, Temel; RUONAN ZHANG; PUNNEN, Abraham P et al.Computers & operations research. 2013, Vol 40, Num 4, pp 920-930, issn 0305-0548, 11 p.Article

Complexity of the min-max and min-max regret assignment problemsAISSI, Hassene; BAZGAN, Cristina; VANDERPOOTEN, Daniel et al.Operations research letters. 2005, Vol 33, Num 6, pp 634-640, issn 0167-6377, 7 p.Article

Optimal tool magazine operation. Part 1: Rotating magazines with unbuffered tool changeNIEMI, E.International journal, advanced manufacturing technology. 2003, Vol 22, Num 9-10, pp 720-726, issn 0268-3768, 7 p.Article