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

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• Title not available (Why is that?)

Cited In (32)

• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Optimizing cane supply decisions within a sugar mill region
• Knapsack polytopes: a survey
• A general heuristic for vehicle routing problems
• Title not available (Why is that?)
• An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
• Using the generalized assignment problem in scheduling the ROSAT space telescope
• Multivariate composite distributions for coefficients in synthetic optimization problems
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
• Towards the real time solution of strike force asset allocation problems
• Heuristics for the multi-resource generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• A VNS approach to multi-location inventory redistribution with vehicle routing
• Solving the generalised assignment problem using polyhedral results
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• Lagrangean/surrogate relaxation for generalized assignment problems
• A tabu search heuristic for the generalized assignment problem
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Relaxation heuristics for a generalized assignment problem
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• Very large-scale variable neighborhood search for the generalized assignment problem
• Title not available (Why is that?)
• Genetic clustering algorithms.
• A dynamic tabu search for large-scale generalized assignment problems
• Title not available (Why is that?)
• An ejection chain approach for the generalized assignment problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A robust heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem

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)