Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
From MaRDI portal
Publication:2336062
Recommendations
- Very large-scale variable neighborhood search for the generalized assignment problem
- An exact method with variable fixing for solving the generalized assignment problem
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- A robust heuristic for the generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
Cites work
- scientific article; zbMATH DE number 5158528 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A Survey of the Generalized Assignment Problem and Its Applications
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A computational study of exact knapsack separation for the generalized assignment problem
- A dynamic tabu search for large-scale generalized assignment problems
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the generalised assignment problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- A tabu search heuristic for the generalized assignment problem
- A two-phase heuristic for set covering
- A variable depth search algorithm with branching search for the generalized assignment problem
- A variation of the generalized assignment problem arising in the New Zealand dairy industry
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An efficient approximation for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- An exact method with variable fixing for solving the generalized assignment problem
- Bees algorithm for generalized assignment problem
- Development and evaluation of an assignment heuristic for allocating cross-trained workers
- Effective algorithm and heuristic for the generalized assignment problem.
- Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
- Large neighborhood search for multi-trip vehicle routing
- Maximal covering code multiplexing access telecommunication networks
- Monotonizing linear programs with up to two nonzeroes per column
- Optimizing cane supply decisions within a sugar mill region
- Solving a real world assignment problem with a metaheuristic
- Solving the generalised assignment problem using polyhedral results
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The Batch Loading and Scheduling Problem
- The Snow Disposal Assignment Problem
- The impact of energy function structure on solving generalized assignment problem using Hopfield neural network
- Using the generalized assignment problem in scheduling the ROSAT space telescope
- Very large-scale variable neighborhood search for the generalized assignment problem
Cited in
(5)- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- An exact method with variable fixing for 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
This page was built for publication: Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336062)
