简介：In1971,thefamousmathematicianGeorgePolya,introducedfourbasicstepsorphasesforsolvingproblems:Step1UnderstandtheProblemStep2DecideonaPlanStep3CarryoutthePlanStep4LookBack

简介：

简介：

简介：

简介：

简介：

简介：

简介：

简介：

简介：Thegeneralizedcomplementarityproblemincludesthewell-knownnonlinearcomplementarityproblemandlinearcomplementarityproblemasspecialcases.Inthispaper,basedonaclassofsmoothingfunctions,asmoothingNewton-typealgorithmisproposedforsolvingthegeneralizedcomplementarityproblem.Undersuitableassumptions,theproposedalgorithmiswell-definedandglobalconvergent.

简介：在这篇论文考虑的反的问题是从散布波浪的远地模式的时间泛音事件地和阶段和振幅的知识决定形状和一个障碍的阻抗在二尺寸。单个层的潜力被用来接近散布波浪。一个近似方法被介绍，建议方法的集中被建立。数字例子被给证明这个方法精确、易用。

简介：Aftergivingasuitablemodelforthecuttingstripsproblem,wepresentabranch-and-pricealgorithmforitbycombiningthecolumngenerationtechniqueandthebranch-and-houndmethodwithLPrelaxations.Sometheoreticalissuesandimplementationdetailsaboutthealgorithmarediscussed,includingthesolutionofthepricingsubproblem,thequalityofLPrelaxations,thebranchingschemeaswellasthecolumnmanagement.Finally,preliminarycomputarionalexperienceisreported.

简介：

简介：

简介：Thekeyideabehindculturalalgorithmistoexplicitlyacquireproblem-solvingknowledgefromtheevolvingpopulationandinreturnapplythatknowledgetoguidethesearch.Inthisarticle,culturalalgorithm-simulatedannealingisproposedtosolvetheroutingproblemofmobileagent.Theoptimalindividualisacceptedtoimprovethebeliefspace’sevolutionofculturalalgorithmsbysimulatedannealing.Thestepsizeinsearchisusedassituationalknowledgetoguidethesearchofoptimalsolutioninthepopulationspace.Becauseofthisfeature,thesearchtimeisreduced.Experimentalresultsshowthatthealgorithmproposedinthisarticlecanensurethequalityofoptimalsolutions,andalsohasbetterconvergencespeed.Theoperationefficiencyofthesystemisconsiderablyimproved.

简介：Inflexiblejob-shopbatchschedulingproblem,theoptimallot-sizeofdifferentprocessisnotalwaysthesamebecauseofdifferentprocessingtimeandset-uptime.Evenforthesameprocessofthesameworkpiece,thechoiceofmachinealsoaffectstheoptimallot-size.Inaddition,differentchoicesoflot-sizebetweentheconstrainedprocesseswillimpactthemanufactureefficiency.Consideringthateachprocesshasitsownappropriatelot-size,weputforwardtheconceptofschedulingwithlot-splittingbasedonprocessandsetuptheschedulingmodeloflot-splittingtocriticalpathprocessasthecore.Themodelcouldupdatethesetofbatchprocessandmachineselectionstrategydynamicallytodetermineprocessingrouteandarrangeproperlot-sizefordifferentprocesses,toachievethepurposeofoptimizingthemakespanandreducingtheprocessingbatcheseffectively.Theexperimentresultsshowthat,comparingwithlot-splittingschedulingschemebasedonworkpiece,thismodeloptimizesthemakespanandimprovestheutilizationefficiencyofthemachine.Italsogreatlydecreasesthemachinedbatches(42%)andreducesthecomplexityofshopschedulingproductionmanagement.

简介：在这份报纸，我们建议为解决不平等的一个算法抑制了得最高分的战略优化问题。在这个算法，活跃集合策略被使用和更多样地，变换不平等的方法抑制了得最高分的战略优化问题进非强迫的优化问题。一个信任区域方法是在抑制优化的一种接受得好的技术保证全球集中并且当他们处理绕行错误时，是更柔韧的。信任区域方法的优点之一是凸不要求模型的客观功能。为建议算法的全球集中分析在一些条件下面被介绍。为了显示出算法的效率，很多个测试问题的数字结果被报导。

简介：Basedonsomerecentresultsforinterlacingeigenvalueintervalsfrom1-parameterfamiliesofsequencesofeigenvalueinequalities,anewmethodisgiventosolvingtheindexproblemforSturm-Liouvilleeigenvaluesforcoupledself-adjointboundaryconditionsintheregularcase.ThekeyisanewcharacteristicprincipleforindicesforSturm-Liouvilleeigenvalues.Thealgorithmcorrespondingonthecharacteristicprinciplearediscussed,andnumericalexamplesarepresentedtoillustratethetheoreticalresultsandshowthatthealgorithmisvalid.

简介：Theplatformschedulingprobleminbattlefieldisoneoftheimportantproblemsinmilitaryoperationalresearch.Itneedstominimizemissioncompletingtimeandmeanwhilemaximizethemissioncompletingaccuracywithalimitednumberofplatforms.Thoughthetraditionalcertainmodelsobtainsomegoodresults,uncertainmodelisstillneededtobeintroducedsincethebattlefieldenvironmentiscomplexandunstable.Anuncertainmodelisprposedfortheplatformschedulingproblem.Relatedparametersinthismodelaresettobefuzzyorstochastic.Duetotheinherentdisadvantageofthesolvingmethodsfortraditionalmodels,anewmethodisproposedtosolvetheuncertainmodel.Finally,thepracticabilityandavailabilityoftheproposedmethodaredemonstratedwithacaseofjointcampaign.

简介：在有损耗的媒介解决电磁的反的散布问题的一个混合方法被建议。坡度搜索方法首先被用来决定目标的空间分发，然后，蒙特卡罗方法被选择计算scatterer的传导性和介电常数。数字实验的结果证实联合二个方法的混合方法是高精确的，有效，并且适合到全球优化。[从作者抽象]