Pages that link to "Item:Q3030567"

The following pages link to A Multiplier Adjustment Method for the Generalized Assignment Problem (Q3030567):

Displaying 50 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS (Q439580) (← links)
• An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
• A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
• Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget (Q632651) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
• Solving capacitated clustering problems (Q799059) (← links)
• On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
• Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
• Repulsive assignment problem (Q963661) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• A collaborative planning approach for intermodal freight transportation (Q989645) (← links)
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• The school bus routing problem: a review (Q1039772) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
• A computational evaluation of two subgradient search methods (Q1089257) (← links)
• Exchanges procedures for timetabling problems (Q1186312) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• An algorithm for the bottleneck generalized assignment problem (Q1260736) (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
• Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
• Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
• Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
• A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
• Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
• A robust heuristic for the generalized assignment problem (Q1339150) (← links)
• A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
• A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
• A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
• The bottleneck generalized assignment problem (Q1388853) (← links)
• Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
• Decentralization of responsibility for site decontamination projects: A budget allocation approach (Q1390197) (← links)
• Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
• Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
• A class of greedy algorithms for the generalized assignment problem (Q1570837) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• Utilizing individual picker skills to improve order batching in a warehouse (Q1694830) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
• Using the generalized assignment problem in scheduling the ROSAT space telescope (Q1806665) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
• Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)