Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

DOI10.1007/s10288-018-0389-zzbMath1425.90059OpenAlexW2892920138MaRDI QIDQ2336062

Salim Haddadi

Publication date: 18 November 2019

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-018-0389-z

zbMATH Keywords

subgradient optimizationgeneralized assignmentVLSN searchmonotone binary programvariable-fixing

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

A three-phase matheuristic algorithm for the multi-day task assignment problem

Cites Work

• Unnamed Item
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• Large neighborhood search for multi-trip vehicle routing
• An exact method with variable fixing for solving the generalized assignment problem
• An efficient approximation for the generalized assignment problem
• A computational study of exact knapsack separation for the generalized assignment problem
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• Solving the generalised assignment problem using polyhedral results
• A variation of the generalized assignment problem arising in the New Zealand dairy industry
• A genetic algorithm for the generalised assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Monotonizing linear programs with up to two nonzeroes per column
• Development and evaluation of an assignment heuristic for allocating cross-trained workers
• Optimizing cane supply decisions within a sugar mill region
• Using the generalized assignment problem in scheduling the ROSAT space telescope
• Maximal covering code multiplexing access telecommunication networks
• A two-phase heuristic for set covering
• Bees algorithm for generalized assignment problem
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• Solving a real world assignment problem with a metaheuristic
• The impact of energy function structure on solving generalized assignment problem using Hopfield neural network
• A path relinking approach with ejection chains for the generalized assignment problem
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• Very large-scale variable neighborhood search for the generalized assignment problem
• The Batch Loading and Scheduling Problem
• A genetic algorithm for the generalised assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• The Snow Disposal Assignment Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
• A tabu search heuristic for the generalized assignment problem
• A dynamic tabu search for large-scale generalized assignment problems
• A Survey of the Generalized Assignment Problem and Its Applications

This page was built for publication: Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem