A Survey of the Generalized Assignment Problem and Its Applications
From MaRDI portal
Recommendations
- The generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- A survey of algorithms for the generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
Cites work
- scientific article; zbMATH DE number 2089255 (Why is no real title available?)
- scientific article; zbMATH DE number 5158528 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- scientific article; zbMATH DE number 3581927 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1960697 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- (1,k)-configuration facets for the generalized assignment problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A branch and bound algorithm for the generalized assignment problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A class of greedy algorithms for the generalized assignment problem
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- A dynamic tabu search for large-scale generalized assignment problems
- A generalized assignment problem with special ordered sets: a polyhedral approach.
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the generalised assignment problem
- A hybrid genetic/optimization algorithm for a task allocation problem
- A hybrid heuristic for the generalized assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- A multi-period order selection problem in flexible manufacturing systems
- A multicriteria approach to the location of public facilities
- A new Lagrangian relaxation approach to the generalized assignment problem
- A note on exact algorithms for the bottleneck generalized assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- A probabilistic feasibility and value analysis of the generalized assignment problem
- A property of assignment type mixed integer linear programming problems
- A robust heuristic for the generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- A simple dual algorithm for the generalised assignment problem
- A survey of algorithms for the generalized assignment problem
- A tabu search heuristic for the generalized assignment problem
- A variation of the generalized assignment problem arising in the New Zealand dairy industry
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Addressing capacity uncertainty in resource-constrained assignment problems
- Algorithms for the Multi-Resource Generalized Assignment Problem
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Effective Lagrangian Heuristic For The Generalized Assignment Problem
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
- An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
- An algorithm for the bottleneck generalized assignment problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- An approximation algorithm for the generalized assignment problem
- An efficient approximation for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- An integer programming model for the allocation of databases in a distributed computer system
- Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
- Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
- Cross-Utilization of Workers Whose Capabilities Differ
- DGAP -- The dynamic generalized assignment problem
- Demand allocation in multiple-product, multiple-facility, make-to-stock systems
- Development and evaluation of an assignment heuristic for allocating cross-trained workers
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- Effective algorithm and heuristic for the generalized assignment problem.
- Exact solutions to a class of stochastic generalized assignment problems
- Extensions to the generalised assignment heuristic for vehicle routing
- Formulating and solving production planning problems
- Further Inprovements to Vehicle Routeing Heuristics
- Generalized Assignment with Nonlinear Capacity Interaction
- Generating Experimental Data for the Generalized Assignment Problem
- Handbook of Approximation Algorithms and Metaheuristics
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Heuristic solution methods for the multilevel generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Heuristics for the multi-resource generalized assignment problem
- How to Allocate Network Centers
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Knapsack-based Algorithms for Designing Cellular Manufacturing Systems
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Location Problems Arising in Computer Networks
- Logic cuts for multilevel generalized assignment problems.
- MINTO, a Mixed INTeger Optimizer
- Management of Program Storage in Computers
- Maximal covering code multiplexing access telecommunication networks
- Modeling Facility Location Problems as Generalized Assignment Problems
- Multiple-facility loading under capacity-based economies of scope
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- On the capacitated concentrator location problem: a reformulation by discretization
- On the quadratic assignment problem
- Optimizing cane supply decisions within a sugar mill region
- P-Complete Approximation Problems
- R \& D planning and the generalized assignment problem
- Relaxation heuristics for a generalized assignment problem
- Scheduling of Project Networks by Job Assignment
- Semi-matchings for bipartite graphs and load balancing
- Solving a real world assignment problem with a metaheuristic
- Solving capacitated clustering problems
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- Solving the Generalized Machine Assignment Problem in Group Technology
- Solving the generalised assignment problem using polyhedral results
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Tabu search for the multilevel generalized assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Batch Loading and Scheduling Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Snow Disposal Assignment Problem
- The bottleneck generalized assignment problem
- The capacitated arc routing problem: Valid inequalities and facets
- The elastic generalized assignment problem
- The generalized assignment problem: Valid inequalities and facets
- The impact of energy function structure on solving generalized assignment problem using Hopfield neural network
- The stochastic generalised assignment problem with Bernoulli demands
- The traveling-salesman problem and minimum spanning trees: Part II
- Tight approximation algorithms for maximum general assignment problems
- Using the generalized assignment problem in scheduling the ROSAT space telescope
- Weighted Assignment Models and Their Application
Cited in
(25)- A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- A novel approach to fault tolerant multichannel networks designing problems
- Assignment problems: a golden anniversary survey
- The generalized assignment problem: Valid inequalities and facets
- R \& D planning and the generalized assignment problem
- scientific article; zbMATH DE number 7780121 (Why is no real title available?)
- Reducing multivalued discrete variables in solving separable task assignment problems
- Fleet management: a vehicle and driver assignment model
- A multi-period renewal equipment problem
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- An optimization approach for hybrid workflows in platform-enabled private service marketplaces
- Improved online algorithms for knapsack and GAP in the random order model
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Mathematical programming and machine learning for a task allocation game
- (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- On the periodic service scheduling problem with non-uniform demands
- Online generalized assignment problem with historical information
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining
- Circular Jaccard distance based multi-solution optimization for traveling salesman problems
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
This page was built for publication: A Survey of the Generalized Assignment Problem and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102818)
