scientific article; zbMATH DE number 40470

DOI10.1002/1520-6750(199203)39:2%3C137::AID-NAV3220390202%3E3.0.CO;2-DzbMATH Open0758.90047MaRDI QIDQ3993983FDOQ3993983

Authors Michael A. Trick 

Publication date 13 August 1992

zbMATH Keywords

heuristiclinear relaxationgeneralized assignmentgeneralized network optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Recommendations

• Relaxation heuristics for a generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• A simple dual algorithm for the generalised assignment problem

Cited in

(32)

• Genetic clustering algorithms.
• A genetic algorithm for the generalised assignment problem
• A tabu search heuristic for the generalized assignment problem
• Multivariate composite distributions for coefficients in synthetic optimization problems
• Heuristics for the multi-resource generalized assignment problem
• 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
• scientific article; zbMATH DE number 3883952 (Why is no real title available?)
• A general heuristic for vehicle routing problems
• A dynamic tabu search for large-scale generalized assignment problems
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• scientific article; zbMATH DE number 6796293 (Why is no real title available?)
• Lagrangean/surrogate relaxation for generalized assignment problems
• A VNS approach to multi-location inventory redistribution with vehicle routing
• Solving the generalised assignment problem using polyhedral results
• Optimizing cane supply decisions within a sugar mill region
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• A robust heuristic for the generalized assignment problem
• 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
• Using the generalized assignment problem in scheduling the ROSAT space telescope
• Towards the real time solution of strike force asset allocation problems
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• An ejection chain approach for the generalized assignment problem
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Very large-scale variable neighborhood search for the generalized assignment problem
• Relaxation heuristics for a generalized assignment problem
• scientific article; zbMATH DE number 3885661 (Why is no real title available?)
• Knapsack polytopes: a survey

Describes a project that uses

Uses Software

• LINDO

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993983)