References
- McCormickWTJrSchweitzerPJWhiteTWProblem decomposition and data reorganization by a clustering techniqueOpns Res197220993100910.1287/opre.20.5.993
- ChinchwadkarGSGohAAn overview of vertical partitioning in object oriented databasesComput J199942395010.1093/comjnl/42.1.39
- LinXOrlowskaMZhangYA graph based cluster approach for vertical partitioning in database designData Knowl Engng19931115116910.1016/0169-023X(93)90003-8
- ÖzsuMTValduriezPPrinciples of Distributed Database Systems1999
- XiaoJZhangYJiaXLiTMeasuring similarity of interests for clustering web-usersAustralian Computer Science Communications. Database Technologies2001107114
- AmirahnadiFChoobinehFIdentifying the composition of a cellular manufacturing systemInt J Prod Res1996342471248810.1080/00207549608905039
- AskinRGCresswellSHGolberdJBVakhariaAJA Hamiltonian Path approach to reordering the part-machine matrix for cellular manufacturingInt J Prod Res1991291081110010.1080/00207549108930121
- BoctorFFThe minimum-cost, machine-part cell formation problemInt J Prod Res1996341045106310.1080/00207549608904949
- LozanoSAdenso-DíazBEguiaIOnisevaLA one-step tabu search algorithm for manufacturing cell designJ Opl Res Soc19995050951610.1057/palgrave.jors.2600704
- SarkerBRLiZMeasuring matrix-based cell formation with alternative routingsJ Opl Res Soc19984995396510.1057/palgrave.jors.2600606
- HochbaumDSApproximation Algorithms for NP-Hard Problems1997
- Perkowitz M and Etzioni O (1998). Adaptive web sites: Automatically synthesizing web pages. In: Proceedings of the 15th National Conference on Artificial Intelligence, Madison, WI, July 1998 American Association for Artificial Intelligence. AAAI Press, pp 727–732.
- DoyleJClumping data in 2-way tables: a user-oriented perspectiveJ Opl Res Soc19944520321310.1057/jors.1994.25
- HarhalakisGLuTMinisINagiRA practical method for design of hybrid-type production facilitiesInt J Prod Res19963489791810.1080/00207549608904942
- ChengC-HA branch and bound clustering algorithmIEEE Trans Systems Man Cybern19952589589810.1109/21.376504
- VeeramaniDManiKA polynomial-time algorithm for optimal clustering in a special class of 0,1-matricesInt J Prod Res1996342587261110.1080/00207549608905046
- NgSMBond energy, rectilinear distance and a worst-case bound for the group technology problemJ Opl Res Soc19914257157810.1057/jors.1991.116
- AartsELenstraJKIntroductionLocal Search in Combinatorial Optimization1997117
- CroesGAA method for solving traveling-salesman problemsOpns Res1958579181210.1287/opre.6.6.791
- GareyMRJohnsonDSComputers and Intractability. A Guide to the Theory of NP-Completeness1979
- GarfinkelRSMotivation and modellingThe Traveling Salesman Problem19851736
- LawlerELLenstraJKRinnooy KanAHGShmoysDBThe Traveling Salesman Problem1985
- LenstraJKClustering a data array and the traveling-salesman problemOpns Res19742241341410.1287/opre.22.2.413
- FredmanMLJohnsonDSMcGeochLAOstheimerGData structures for traveling salesmenJ Algorithms19951843247910.1006/jagm.1995.1018
- LinSKernighanBWAn effective heuristic for the traveling- salesman problemOpns Res19732149851610.1287/opre.21.2.498
- JohnsonDSMcGeochLAThe traveling salesman problem: a case studyLocal Search in Combinatorial Optimization1997215310
- KindervaterGAPSavelsberghMWPVehicle routing: handling edge exchangesLocal Search in Combinatorial Optimization1997337
- ChandraBKarloffHToveyCNew results on the old k-opt algorithm for the traveling salesman problemSIAM J Comput1999281998202910.1137/S0097539793251244