References
- AckoffRLOptimization+objectivity=opt outEur J Opl Res197711710.1016/S0377-2217(77)81003-5
- Müller-MerbachHHeuristics and their design: a surveyEur J Opl Res1981812310.1016/0377-2217(81)90024-2
- ClaysonJMicro-operational research: a simple modeling tool for managersModels of Reality1984
- LenatDBThe nature of heuristicsArtif Intell19821918924910.1016/0004-3702(82)90036-4
- FouldsLRThe heuristic problem-solving approachJ Opl Res Soc19833492793410.1057/jors.1983.205
- ZanakisSHEvansJRVazacopoulosAAHeuristic methods and applications: a categorized surveyEur J Oper Res1989438811010.1016/0377-2217(89)90412-8
- MichalewiczZFogelDBHow to Solve It: Modern Heuristics2000
- MortonTEPenticoDWHeuristic Scheduling Systems1993
- ReevesCRModern Heuristic Techniques for Combinatorial Problems1993
- IgnizioJPSolving large-scale problems: a venture into a new dimensionJ Opl Res Soc19803121722510.1057/jors.1980.39
- Muller-MalekHMatthysDNelisEHeuristics and expert-like systemsBelg J Oper Res Statist Comput Sci1997272563
- PinedoMSimchi-LeviDHeuristic methodsMathematical Programming for Industrial Engineers1996575617
- SilverEAVidalRVVde WerraDA tutorial on heuristic methodsEur J Opl Res1980515316210.1016/0377-2217(80)90084-3
- WhiteDJHeuristic programmingIMA J Math Appl Business Ind19902173188
- ZanakisSHEvansJRHeuristic ‘optimization’: why, when, and how to use itInterfaces1981115849110.1287/inte.11.5.84
- ChurchmanCWOperations research as a professionManagement Sci197017B37B5310.1287/mnsc.17.2.B37
- EilonSMore against optimizationOmega1977562763310.1016/0305-0483(77)90044-5
- GloverFHeuristics for integer programming using surrogate constraintsDecision Sci1977815616610.1111/j.1540-5915.1977.tb01074.x
- WoolseyREDSwansonHSOperations Research for Immediate Applications197568
- HaesslerRWDeveloping an industrial-grade heuristic problem-solving procedureInterfaces1983133627110.1287/inte.13.3.62
- BartholdiJJIIIPlatzmanLKHeuristics based on spacefilling curves for combinatorial problems in Euclidean spaceManagement Sci19883429130510.1287/mnsc.34.3.291
- FisherMLWorst-case analysis of heuristic algorithmsManagement Sci19802611710.1287/mnsc.26.1.1
- MasonARyanDPantonDIntegrated simulation, heuristic and optimization approaches to staff schedulingOper Res19984616117510.1287/opre.46.2.161
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of N.P. Completeness1979
- LawlerECombinatorial Optimization1976
- HallLComputational complexityEncyclopedia of Operations Research and Management Science2000119122
- ToveyCATutorial on computational complexityInterfaces2002323306110.1287/inte.32.3.30.39
- HoffmanKLPadbergMTraveling salesman problemEncyclopedia of Operations Research and Management Science2000849853
- KakuBFacilities layoutEncyclopedia of Operations Research and Management Science2000279282
- KolischRResource allocation capabilities of commercial project management software packagesInterfaces1999294193110.1287/inte.29.4.19
- MagnantiTLNetwork optimizationEncyclopedia of Operations Research and Management Science2000555561
- BodinLVehicle routingEncyclopedia of Operations Research and Management Science2000865870
- CordeauJKGendreauMLaporteGPotvinJYSemetFA guide to vehicle routing heuristicsJ Opl Res Soc20025351252210.1057/palgrave.jors.2601319
- LustigIPugetJ-FConstraint programmingEncyclopedia of Operations Research and Management Science2000136141
- WhiteGMConstrained satisfaction, not so constrained satisfaction and the timetabling problemProceedings of the Third International Conference on the Practice and Theory of Automated Timetabling20003247
- JönssonHSilverEACommon component inventory problems with a budget constraint: heuristics and upper boundsEngrg Costs Production Econom198918718110.1016/0167-188X(89)90025-6
- YanoCALeeHLLot sizing with random yields: a reviewOper Res19954331133410.1287/opre.43.2.311
- McGillJIvan RyzinGJRevenue management: research overview and perspectivesTransportation Sci19993323325610.1287/trsc.33.2.233
- WeatherfordLRBelobabaPPRevenue impacts of fare input and demand forecast accuracy in airline yield managementJ Opl Res Soc20025381182110.1057/palgrave.jors.2601357
- SilverEAPykeDFPetersonRInventory Management and Production Planning and Scheduling1998
- RuggieroVRThe Art of Thinking199575
- BaumSCarlsonROn solutions that are better than mostOmega1979724925510.1016/0305-0483(79)90060-4
- MabertVAWhybarkDCSampling as a solution methodologyDecision Sci1977816718010.1111/j.1540-5915.1977.tb01075.x
- BollapragadaSMortonTEMyopic heuristics for the random yield problemOper Res19994771372210.1287/opre.47.5.713
- BertsekasDDynamic Programming and Optimal Control2001
- AgrawalNSmithSATsayAAMulti-vendor sourcing in a retail supply chainProduction Oper Management20021115718210.1111/j.1937-5956.2002.tb00489.x
- Klassen KJ and Rohleder TR (2002). Planning for urgent clients in a dynamic, rolling horizon environment. Decision Sciences Institute 2002 Annual Meeting Proceedings. Decisions Sciences Institute, Atlanta, Georgia, pp. 2161–2166.
- McAllisterCDRyanSMRelative risk characteristics of rolling horizon hedging heuristics for capacity expansionEng Economist20004511512810.1080/00137910008967540
- FedergruenATzurMTime-partitioning heuristics: application to one warehouse, multi-item, multi-retailer lot-sizing problemsNaval Res Logistics19994646348610.1002/(SICI)1520-6750(199908)46:5<463::AID-NAV2>3.0.CO;2-S
- KarpRMProbabilistic analysis of partitioning algorithms for the traveling-salesman problem in the planeMath Oper Res1977220922410.1287/moor.2.3.209
- HaxACMealHCHierarchical integration of production planning and schedulingLogistics19755369
- BitranGRTirupatiDHierarchical production planningLogistics of Production and Inventory1993
- FryTDCoxJFBlackstoneJHJrAn analysis and discussion of the optimized production technology software and its useProduction Oper Management1992122924210.1111/j.1937-5956.1992.tb00355.x
- DixonPSSilverEAA heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problemJ Oper Management19812234010.1016/0272-6963(81)90033-4
- PolyaGHow to Solve It: A New Aspect of Mathematical Method1957
- BildeOVidalRVVOn the connections between locations and scheduling problemsSimulation Councils Proceedings Series1973
- Zufferey N (2002). Heuristiques pour les problèmes de coloration des sommets d’un graphe et d’affectation de fréquences avec polarités. Unpublished Doctoral Thesis, Institut de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Switzerland, pp 121–126.
- EhrhardtRThe power approximation for computing (s,S) inventory policiesManagement Sci19792577778610.1287/mnsc.25.8.777
- IgnizioJPBurkeLINeural networksEncyclopedia of Operations Research and Management Science2000569571
- CunninghamPSmythBCase-based reasoning and scheduling: reusing solution componentsInt J Production Res1997352947296110.1080/002075497194237
- RosingKEReVelleCSRollandESchillingDACurrentJRHeuristic concentration and tabu search: a head to head comparisonEur J Opl Res1998104939910.1016/S0377-2217(97)00310-X
- EvansJRA network decomposition/aggregation procedure for a class of multicommodity transportation problemsNetworks19831319720510.1002/net.3230130205
- GeoffrionAMA priori error bounds for procurement commodity aggregation in logistics planning modelsNaval Res Logistics Quart19772420121210.1002/nav.3800240202
- PenticoDWMultistage production systems with random yield: heuristics and optimalityInt J Production Res1994322455246210.1080/00207549408957077
- RajagopalanSMake to order or make to stock: model and applicationManagement Sci20024824125610.1287/mnsc.48.2.241.255
- van RoyBBertsekasDPLeeYTsitsiklisJNA neuro-dynamic programming approach to retailer inventory managementIEEE Trans Control199816133
- SilverEAMealHCA heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishmentProduction Inventory Management J1973146474
- BitranGRYanasseHHDeterministic approximations to stochastic production problemsOper Res198432999101810.1287/opre.32.5.999
- TijmsHCStochastic Modelling and Analysis: A Computational Approach1986
- van HoutumGJZijmWHMComputational procedures for stochastic multi-echelon production systemsInt J Production Econom19912322323710.1016/0925-5273(91)90065-2
- ShoreHA general solution of the preventive maintenance problem when data are right-censoredAnn Oper Res19999125126110.1023/A:1018901807531
- ShoreHOptimal solutions for stochastic inventory models when the lead-time demand distribution is partially specifiedInt J Production Econom19995947748510.1016/S0925-5273(98)00037-1
- ZainoNJrD'ErricoJOptimal discrete approximations for continuous outcomes with applications in decision and risk analysisJ Opl Res Soc19894037938810.1057/jors.1989.56
- GrossmanTARohlederTRSilverEAA negotiation aid for fixed quantity contracts with stochastic demand and productionInt J Production Econom200066677610.1016/S0925-5273(99)00107-3
- JönssonHSilverEASome insights regarding selecting sets of scenarios in combinatorial stochastic problemsInt J Production Econom19964546347210.1016/0925-5273(95)00145-X
- KimK-JDiwekarUMHammersley stochastic annealing: efficiency improvement for combinatorial optimization under uncertaintyIIE Trans200234761777
- ConsigliGDempsterMAHThe CALM stochastic programming model for dynamic asset-liability managementAnn Oper Res19988113116110.1023/A:1018992620909
- AgrawalASmithSATsayAAMulti-vendor sourcing in a retail supply chainProduction Oper Management20021115718210.1111/j.1937-5956.2002.tb00489.x
- FellerWAn Introduction to Probability Theory and Its Applications1966355
- SilverEAA control system for coordinated inventory replenishmentInt J Production Res19741264767110.1080/00207547408919583
- WhittWApproximations for the GI/G/m queueJ Production Oper Management1993211416110.1111/j.1937-5956.1993.tb00094.x
- SuriRde TrevilleSFull speed aheadOR/MS Today19911833442
- SilverEAA simple method of determining order quantities in joint replenishments under deterministic demandManagement Sci1976221351136110.1287/mnsc.22.12.1351
- FisherMLJaikumarRA generalized assignment heuristic for vehicle routingNetworks19811110912410.1002/net.3230110205
- BertsimasDDemirRAn approximate dynamic programming approach to multidimensional knapsack problemsManagement Sci20024855056510.1287/mnsc.48.4.550.208
- PattersonRRollandEThe cardinality constrained covering traveling salesman problemComput Oper Res2003309711610.1016/S0305-0548(01)00084-3
- Dominguez-BallesterasBMitraGLucasCKoutsoukisN-SModelling and solving environments for mathematical programming (MP): a status review and new directionsJ Oper Res Soc2002531072109210.1057/palgrave.jors.2601361
- BeasleyJELagrangian relaxationModern Heuristic Techniques for Combinatorial Problems1993
- FisherMLAn applications oriented guide to lagrangian relaxationInterfaces1985152102110.1287/inte.15.2.10
- GoldenBBodinLDoyleTStewartWJrApproximate traveling salesman algorithmsOper Res19802869471110.1287/opre.28.3.694
- AtkinsonJBA greedy look-ahead heuristic for combinatorial optimization: an application to vehicle scheduling with time windowsJ Oper Res Soc19944567368410.1057/jors.1994.105
- ArmourGCBuffaESA heuristic algorithm and simulation approach to relative location of facilitiesManagement Sci1963929430010.1287/mnsc.9.2.294
- LinSKernighanBWAn effective heuristic algorithm for the traveling-salesman problemOper Res19732149851610.1287/opre.21.2.498
- BoxGEPVoulePVThe exploration and exploitation of response surfaces: an example of the link between the fitted surface and the basic mechanism of the systemBiometric19551128732310.2307/3001769
- GloverFTabu search: a tutorialInterfaces1990204749410.1287/inte.20.4.74
- OsmanIHPreface: focussed issue on applied meta-heuristicsComput Indust Eng20024420520710.1016/S0360-8352(02)00175-4
- TaillardEDGambardellaLMGendreauMPotvinJYAdaptive memory programming: a unified view of metaheuristicsEur J Opl Res200113511610.1016/S0377-2217(00)00268-X
- HertzAWidmerMGuidelines for the use of meta-heuristics in combinatorial optimizationEur J Opl Res200315124725210.1016/S0377-2217(02)00823-8
- BrandtAMulti-level adaptive solutions to boundary value problemsMath Comput19773133339010.1090/S0025-5718-1977-0431719-X
- TengSACoarsening, sampling and smoothing: elements of the multilevel methodAlgorithms for Parallel Processing. IMA Volumes in Mathematics and its Applications1999247276
- Walshaw C (To appear). Multilevel refinement for combinatorial optimization problems. Ann Oper Res.
- MittenLGBranch and bound methods: general formulations and propertiesOper Res197018243410.1287/opre.18.1.24
- OwPSMortonTEFiltered beam search in schedulingInt J Production Res198826356210.1080/00207548808947840
- Delle CroceFT’kindtVA recovering beam search algorithm for the one-machine dynamic total completion time scheduling problemJ Opl Res Soc2002531275128010.1057/palgrave.jors.2601389
- GloverFTabu searchEncyclopedia of Operations Research and Management Science2000821827
- GloverFTaillardEde WerraDA user's guide to tabu searchAnn Oper Res19934132810.1007/BF02078647
- HertzATaillardEDde WerraDA tutorial on tabu searchLocal Search in Combinatorial Optimization1997121136
- GloverFLagunaMTabu Search1997
- CostaDSilverEATabu search when noise is present: an illustration in the context of cause and effect analysisJ Heuristics1998452310.1023/A:1009636520440
- CostaDAn evolutionary tabu search algorithm and the NHL scheduling problemINFOR199533161177
- TaillardEDRobust tabu search for the quadratic assignment problemParallel Computing19911744345510.1016/S0167-8191(05)80147-4
- HasegawaMIkeguchiTAiharaKItohKA novel chaotic search for quadratic assignment problemsEur J Oper Res200213954355610.1016/S0377-2217(01)00189-8
- GloverFTabu search — part IORSA J Computing1989119020610.1287/ijoc.1.3.190
- NanobeKIbarakiTA tabu search approach to the constraint satisfaction problem as a general problem solverEur J Opl Res199810659962310.1016/S0377-2217(97)00294-4
- ChelouahRSiarryPTabu search applied to global optimizationEur J Opl Res200012325627010.1016/S0377-2217(99)00255-6
- AnandalingamGSimulated annealingEncyclopedia of Operations Research and Management Science2000748751
- DowslandKASimulated annealingModern Heuristic Techniques for Combinatorial Problems1993
- VidalRVVApplied Simulated Annealing1993
- OsmanIHMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnn Oper Res19934142145110.1007/BF02023004
- DueckGNew optimization heuristics: the great deluge algorithm and the record-to-record travelJ Comput Phys1993104869210.1006/jcph.1993.1010
- MladenovićNHansenPVariable neighbourhood searchComput Oper Res1997241097110010.1016/S0305-0548(97)00031-2
- HansenPMladenovićNVariable neighbourhood searchHandbook of Applied Optimization2002221234
- VoudourisCTsangEGuided local search and its application to the travelling salesman problemEur J Opl Res199911346949910.1016/S0377-2217(98)00099-X
- TsubakitaniSEvansJRAn empirical study of a new metaheuristic for the traveling salesman problemEur J Opl Res199810411312810.1016/S0377-2217(96)00334-7
- FeoTAResendeMGCGreedy randomized adaptive search proceduresJ Global Optim1995610913310.1007/BF01096763
- PitsoulisLSResendeMGCGreedy randomized adaptive search proceduresHandbook of Applied Optimization2002168183
- PattersonRRollandEPirkulHA memory adaptive reasoning technique for solving the capacitated minimum spanning tree problemJ Heuristics1999515918010.1023/A:1009629727566
- FleurentCGloverFImproved constructive multi-start strategies for the quadratic assignment problem using adaptive memoryINFORMS J Computing19991119820410.1287/ijoc.11.2.198
- DorigoMManiezzoVColorniAThe ant system: optimization by a colony of cooperating agentsIEEE Trans Systems Man Cybernet — Part B199626294110.1109/3477.484436
- DorigoMDi CaroGThe ant colony optimization meta-heuristicNew Ideas in Optimization19991132
- GambardellaLMTaillardEDDorigoMAnt colonies for the quadratic assignment problemJ Opl Res Soc19995016717610.1057/palgrave.jors.2600676
- ReevesCRGenetic algorithmsModern Heuristic Techniques for Combinatorial Problems1993
- BeasleyJEPopulation heuristicsHandbook of Applied Optimization2002138156
- GoldbergDEGenetic Algorithms in Search, Optimization and Machine Learning1989
- MoonISilverEAChoiSA hybrid genetic algorithm for the economic lot scheduling problemInt J Production Res20024080982410.1080/00207540110095222
- RochatYA genetic approach for solving a scheduling problem in a robotized analytical systemJ Heuristics1998424526110.1023/A:1009613700772
- ArmonyMKlincewiczJGLussHRosenweinMBDesign of stacked self-healing rings using a genetic algorithmJ Heuristics200068510510.1023/A:1009665726946
- YagiuraMIbarakiTThe use of dynamic programming in genetic algorithms for permutation problemsEur J Opl Res19969238740110.1016/0377-2217(94)00301-7
- ChelouahRSiarryPA continuous genetic algorithm designed for the global optimization of multimodal functionsJ Heuristics2000619121310.1023/A:1009626110229
- GloverFScatter search and star path: beyond the genetic metaphorOR Spektrum19951712513710.1007/BF01719256
- Laguna M . Scatter search. In Pardalos PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 183–194.
- RochatYTaillardEProbabilistic diversification and intensification in local search for vehicle routingJ Heuristics1995114716710.1007/BF02430370
- GoldenBLLaporteGTaillardEAn adaptive memory heuristic for a class of vehicle routing problems with minimax objectiveComput Oper Res19972444545210.1016/S0305-0548(96)00065-2
- MoscatoPMemetic AlgorithmsHandbook of Applied Optimization2002157168
- BellPCVisual interactive modelling: the past, the present, and the prospectsEur J Opl Res19915427428610.1016/0377-2217(91)90101-Z
- BrightJGJohnstonKJWhither VIM? a developer's viewEur J Opl Res19915435736210.1016/0377-2217(91)90111-8
- ChauPBellPCDecision support for the design of a new production plant using visual interactive simulationJ Opl Res Soc1994451273128410.1057/jors.1994.200
- FisherMLInteractive optimizationAnn Oper Res1985554155610.1007/BF02739238
- SegalMWeinbergerDTurfingOper Res19772536738610.1287/opre.25.3.367
- PirkulHGuptaRRollandEVisOpt: a visual interactive optimization tool for P-median problemsDecision Support Syst19992620922310.1016/S0167-9236(99)00032-9
- CornuejolsGFisherMLNemhauserGLLocation of bank accounts to optimize float: an analytic study of exact and approximate algorithmsManagement Sci19772378981010.1287/mnsc.23.8.789
- BarrRGoldenBKellyJResendeMStewartWJrDesigning and reporting on computational experiments with heuristic methodsJ Heuristics1995193210.1007/BF02430363
- RardinRLUzsoyRExperimental evaluation of heuristic optimization algorithms: a tutorialJ Heuristics2001726130410.1023/A:1011319115230
- HookerJNTesting heuristics: we have it all wrongJ Heuristics19951334210.1007/BF02430364
- MontgomeryDCDesign and Analysis of Experiments1991
- KuehlRODesign of Experiments: Statistical Principles of Design and Analysis2000
- EvansJRHallRAProbabilistic analysis of assignment ranking: the traveling salesman problemAmer J Math Management Sci198447188
- MarinASalmeronSTactical design of rail freight networks. Part II: local search methods with statistical analysisEur J Opl Res199694435310.1016/0377-2217(95)00193-X
- McRobertsKLA search model for evaluating combinatorially explosive problemsOper Res1971191331134910.1287/opre.19.6.1331
- HillierMSThe costs and benefits of commonality in assemble-to-order systems with a (Q,r) - policy for component replenishmentEur J Opl Res200214157058610.1016/S0377-2217(01)00279-X
- KleinRSchollAComputing lower bounds by destructive improvement: an application to resource-constrained project schedulingEur J Opl Res199911232234610.1016/S0377-2217(97)00442-6
- GuptaJNDSextonRSTuncEASelecting scheduling heuristics using neural networksINFORMS J Computing20001215016210.1287/ijoc.12.2.150.11893