A Multiplier Adjustment Method for the Generalized Assignment Problem
From MaRDI portal
Recommendations
- Effective algorithm and heuristic for the generalized assignment problem.
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
Cited in
(84)- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Optimizing barge utilization in hinterland container transportation
- A computational evaluation of two subgradient search methods
- The school bus routing problem: a review
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- Optimizing cane supply decisions within a sugar mill region
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Repulsive assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- Maximal covering code multiplexing access telecommunication networks
- An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem
- Exact methods and a variable neighborhood search for the robust capacitated p-median problem
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- A hybrid algorithm for the generalized assignment problem
- Generalized cover facet inequalities for the generalized assignment problem
- The bottleneck generalized assignment problem
- A column generation approach to job grouping for flexible manufacturing systems
- A heuristic for BILP problems: the single source capacitated facility location problem
- A Lagrangean dual-based solution method for a special linear programming problem
- On a class of assignment problems.
- Minimization of makespan in generalized assignment problem.
- Using the generalized assignment problem in scheduling the ROSAT space telescope
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
- Auxiliary tool allocation in flexible manufacturing systems
- Lagrangean heuristics for location problems
- Decentralization of responsibility for site decontamination projects: A budget allocation approach
- Multivariate composite distributions for coefficients in synthetic optimization problems
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Planning cost-effective operational forest inventories
- Contemporary approaches in matheuristics an updated survey
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Matheuristics: survey and synthesis
- Heuristics for the multi-resource generalized assignment problem
- A Survey of the Generalized Assignment Problem and Its Applications
- Solving the generalised assignment problem using polyhedral results
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A collaborative planning approach for intermodal freight transportation
- Lagrangean/surrogate relaxation for generalized assignment problems
- Solving capacitated clustering problems
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments
- Exchanges procedures for timetabling problems
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A tabu search heuristic for the generalized assignment problem
- A simple dual algorithm for the generalised assignment problem
- On the periodic service scheduling problem with non-uniform demands
- Lagrangean relaxation. (With comments and rejoinder).
- Relaxation heuristics for a generalized assignment problem
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- An algorithm for the bottleneck generalized assignment problem
- Time-cost Trade-off Relations in Bulk Transportation Problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS
- scientific article; zbMATH DE number 2168951 (Why is no real title available?)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
- Optimizing single-terminal dispatch of large volume trips to trucks
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Bees algorithm for generalized assignment problem
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- An ejection chain approach for the generalized assignment problem
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
- A dynamic tabu search for large-scale generalized assignment problems
- Optimal ABC inventory classification using interval programming
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A robust heuristic for the generalized assignment problem
- Tabu search for the multilevel generalized assignment problem
- Online multi-dimensional generalized assignment problem with predictions
- Logic cuts for multilevel generalized assignment problems.
- Effective algorithm and heuristic for the generalized assignment problem.
- Utilizing individual picker skills to improve order batching in a warehouse
- A class of greedy algorithms for the generalized assignment problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- A multiplier adjustment technique for the capacitated concentrator location problem
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- A set partitioning heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- On solving the Lagrangian dual of integer programs via an incremental approach
This page was built for publication: A Multiplier Adjustment Method for the Generalized Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030567)
