A Multiplier Adjustment Method for the Generalized Assignment Problem
From MaRDI portal
Publication:3030567
DOI10.1287/mnsc.32.9.1095zbMath0626.90036OpenAlexW2147336456MaRDI QIDQ3030567
Luk N. Van Wassenhove, Ramchandran Jaikumar, Marshall L. Fisher
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.32.9.1095
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Maximal covering code multiplexing access telecommunication networks, Lagrangean relaxation. (With comments and rejoinder)., Optimizing single-terminal dispatch of large volume trips to trucks, A robust heuristic for the generalized assignment problem, A new Lagrangian relaxation approach to the generalized assignment problem, A computational evaluation of two subgradient search methods, A heuristic for BILP problems: the single source capacitated facility location problem, A column generation approach to job grouping for flexible manufacturing systems, Heuristics for the multi-resource generalized assignment problem, Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search, On solving the Lagrangian dual of integer programs via an incremental approach, Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems, A genetic algorithm for the generalised assignment problem, A simple dual algorithm for the generalised assignment problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, The bottleneck generalized assignment problem, Tabu search for the multilevel generalized assignment problem, Decentralization of responsibility for site decontamination projects: A budget allocation approach, Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity, Matheuristics: survey and synthesis, A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs, A Survey of the Generalized Assignment Problem and Its Applications, Utilizing individual picker skills to improve order batching in a warehouse, Logic cuts for multilevel generalized assignment problems., Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget, Lagrangean decomposition: A model yielding stronger lagrangean bounds, Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS, A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem, Effective algorithm and heuristic for the generalized assignment problem., Improved Lagrangean decomposition: An application to the generalized assignment problem, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Multivariate composite distributions for coefficients in synthetic optimization problems, Enriching Solutions to Combinatorial Problems via Solution Engineering, Generalized cover facet inequalities for the generalized assignment problem, Exchanges procedures for timetabling problems, On a class of assignment problems., Minimization of makespan in generalized assignment problem., Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach, A survey of algorithms for the generalized assignment problem, On the variable-depth-search heuristic for the linear-cost generalized assignment problem, Repulsive assignment problem, An homage to Joseph-Louis Lagrange and Pierre Huard, A new extended formulation of the generalized assignment problem and some associated valid inequalities, A tabu search heuristic for the generalized assignment problem, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Bees algorithm for generalized assignment problem, A dynamic tabu search for large-scale generalized assignment problems, A hybrid algorithm for the generalized assignment problem, A Lagrangean dual-based solution method for a special linear programming problem, A collaborative planning approach for intermodal freight transportation, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Optimal ABC inventory classification using interval programming, An algorithm for the generalized quadratic assignment problem, Lagrangean heuristics for location problems, Optimizing cane supply decisions within a sugar mill region, Using the generalized assignment problem in scheduling the ROSAT space telescope, An algorithm for the bottleneck generalized assignment problem, Lagrangean/surrogate relaxation for generalized assignment problems, Auxiliary tool allocation in flexible manufacturing systems, Time-cost Trade-off Relations in Bulk Transportation Problem, Optimizing barge utilization in hinterland container transportation, Relaxation heuristics for a generalized assignment problem, An application-oriented guide for designing Lagrangean dual ascent algorithms, A class of greedy algorithms for the generalized assignment problem, An exact method for the two-echelon, single-source, capacitated facility location problem, The school bus routing problem: a review, Efficient cuts in Lagrangean `relax-and-cut' schemes, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, Solving the generalised assignment problem using polyhedral results, An ejection chain approach for the generalized assignment problem, A multiplier adjustment technique for the capacitated concentrator location problem, Solving capacitated clustering problems, A set partitioning heuristic for the generalized assignment problem
