Pages that link to "Item:Q4066849"

The following pages link to A branch and bound algorithm for the generalized assignment problem (Q4066849):

Displaying 50 items.

• Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
• Master surgery scheduling with consideration of multiple downstream units (Q297106) (← links)
• Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
• The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
• A GRASP heuristic for slab scheduling at continuous casters (Q480761) (← links)
• Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971) (← links)
• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
• A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
• An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
• A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
• A comparison of techniques for solving the fleet size and mix vehicle routing problem (Q800225) (← links)
• Elitist genetic algorithm for assignment problem with imprecise goal (Q856264) (← links)
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
• A new variant of the partitioning shortest path algorithm (Q1074506) (← links)
• Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
• An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
• A study of the bottleneck single source transportation problem (Q1085063) (← links)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
• An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
• The vehicle routing problem with backhauls (Q1119178) (← links)
• A multicriteria approach to the location of public facilities (Q1138985) (← links)
• Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
• The design of multiactivity multifacility systems (Q1171982) (← links)
• Locational analysis (Q1173002) (← links)
• Exchanges procedures for timetabling problems (Q1186312) (← links)
• The \(K\)-coverage concentrator location problem (Q1193145) (← links)
• An algorithm for storage device selection and file assignment (Q1194722) (← links)
• Probabilistic analysis of the generalised assignment problem (Q1196166) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• The 0-1 knapsack problem with multiple choice constraints (Q1248462) (← links)
• An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
• An algorithm for the bottleneck generalized assignment problem (Q1260736) (← links)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems (Q1278859) (← links)
• Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP) (Q1291708) (← links)
• Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
• Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← 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)