scientific article
From MaRDI portal
Publication:3993983
DOI<137::AID-NAV3220390202>3.0.CO;2-D 10.1002/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-DzbMath0758.90047MaRDI QIDQ3993983
Publication date: 13 August 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Knapsack polytopes: a survey, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Heuristics for the multi-resource generalized assignment problem, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, A genetic algorithm for the generalised assignment problem, A VNS approach to multi-location inventory redistribution with vehicle routing, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, A general heuristic for vehicle routing problems, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, A Survey of the Generalized Assignment Problem and Its Applications, Multivariate composite distributions for coefficients in synthetic optimization problems, Towards the real time solution of strike force asset allocation problems, A tabu search heuristic for the generalized assignment problem, A dynamic tabu search for large-scale generalized assignment problems, An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports, Genetic clustering algorithms., Very large-scale variable neighborhood search for the generalized assignment problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Optimizing cane supply decisions within a sugar mill region, Using the generalized assignment problem in scheduling the ROSAT space telescope, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, Solving the generalised assignment problem using polyhedral results, An ejection chain approach for the generalized assignment problem
Uses Software
Cites Work
