References
- ChenGKhanSLiKFManningEBuilding an adaptive multimedia system using the utility modelParallel and Distributed Processing1999289298
- WatsonRKPacket Networks and optimal admission and upgrade of service level agreements: applying the utility model2001
- Voudouris C and Tsang EPK (1996). Partial constraint satisfaction problems and guided local search for combinatorial. In: Proceedings of Practical Application of Constraint Technology (PACT'96), pp 337–356. http://cswww.essex.ac.uk/csp/gls-papers.html
- VoudourisCTsangEPKGuided local search and its application to the travelling salesman problemEur J Opl Res199911346949910.1016/S0377-2217(98)00099-X
- MartelloSTothPKnapsack Problems: Algorithms and Computer Implementations1990
- ChuPBeasleyJEA genetic algorithm for the multidimensional knapsack ProblemJ Heuristics19984638610.1023/A:1009642405419
- MartelloSTothPAlgorithms for knapsack problemsAnn Discrete Math1987317079
- BalasEZemelEAn algorithm for large zero-one knapsack problemOpns Res1980281130115410.1287/opre.28.5.1130
- FayardDPlateauGAn algorithm for the solution of the 0-1 knapsack problemComputing19822826928710.1007/BF02241754
- MartelloSTothPA new algorithm for the 0-1 knapsack problemMngt Sci19883463364410.1287/mnsc.34.5.633
- PisingerDA minimal algorithm for the 0-1 knapsack problemOpns Res19974575876710.1287/opre.45.5.758
- MartelloSPisingerDTothPDynamic programming and strong bounds for the 0-1 knapsack problemMngt Sci19994541442410.1287/mnsc.45.3.414
- FrevilleAPlateauGAn efficient preprocessing procedure for the multidimensional 0-1 knapsack problemDiscrete Appl Math19944918921210.1016/0166-218X(94)90209-7
- ShihWA branch and bound method for the multiconstraint zero-one knap-sack problemJ Opl Res Soc19793036937810.1057/jors.1979.78
- NaussMRThe 0-1 knapsack problem with multiple-choice constraintsEur J Opl Res1978212513110.1016/0377-2217(78)90108-X
- KhanSQuality adaptation in a multi-session adaptive multimedia system: model, algorithms and architecture1998
- PisingerDAn exact algorithm for large multiple knapsack problemsEur J Opl Res199911452854110.1016/S0377-2217(98)00120-9
- ToyodaYA simplified algorithm for obtaining approximate solution to zero-one programming problemsMngt Sci1975211417142710.1287/mnsc.21.12.1417
- DantzigGBDiscrete variable extremum problemsOpns Res1957526627710.1287/opre.5.2.266
- MoserMJokanovićDPShiratoriNAn algorithm for the multidimesional multiple-choice knapsack problemIEICE Trans Fundamentals Electron199780582589
- KhanSLiKFManningEGAkbarMDMSolving the knapsack problem for adaptive multimedia systemsStud Inform20022154174
- Hansen P (1986). The steepest ascent mildest descent heuristic for combinatorial programming, Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
- GloverFFuture paths for integer programming and links to artificial intelligenceComput Opns Res19861353354910.1016/0305-0548(86)90048-1
- GloverFLagunaMTabu search1997
- VoudourisCTsangEPKGuided local search1995
- TsangEPKVoudourisCFast local search and guided local search and their application to British Telecom's worforce scheduling problemOpns Res Lett19972011912710.1016/S0167-6377(96)00042-9
- KilbyPProsserPShawPGuided local search for the vehicle routing problem with time windowsMeta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization1997473486
- FaroeOPisingerDZachariasenMGuided local search for the three-dimensional bin packing problemINFORMS J Comput20031526728310.1287/ijoc.15.3.267.16080