A branch and bound algorithm for the generalized assignment problem
From MaRDI portal
Cites work
- A Branch Search Algorithm for the Knapsack Problem
- A tree-search algorithm for mixed integer programming problems
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- An Improved Implicit Enumeration Approach for Integer Programming
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Multicommodity Distribution System Design by Benders Decomposition
- Reduction Algorithm for Zero-One Single Knapsack Problems
Cited in
(98)- An algorithm for the generalized quadratic assignment problem
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Microcomputer-based algorithms for large scale shortest path problems
- A new variant of the partitioning shortest path algorithm
- Some computational results on real 0-1 knapsack problems
- An integer programming model for the allocation of databases in a distributed computer system
- A study of the bottleneck single source transportation problem
- Efficient algorithms for the capacitated concentrator location problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- An improved direct descent algorithm for binary knapsack problems
- The vehicle routing problem with backhauls
- A multicriteria approach to the location of public facilities
- Surrogate duality relaxation for job shop scheduling
- The design of multiactivity multifacility systems
- Locational analysis
- Exchanges procedures for timetabling problems
- The \(K\)-coverage concentrator location problem
- An algorithm for storage device selection and file assignment
- Probabilistic analysis of the generalised assignment problem
- A survey of algorithms for the generalized assignment problem
- The 0-1 knapsack problem with multiple choice constraints
- An algorithm and efficient data structures for the binary knapsack problem
- An algorithm for the bottleneck generalized assignment problem
- Computational comparison on the partitioning strategies in multiple choice integer programming
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Constructing a course schedule by solving a series of assignment type problems
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Solving the generalised assignment problem using polyhedral results
- A set partitioning heuristic for the generalized assignment problem
- Optimizing single-terminal dispatch of large volume trips to trucks
- A robust heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- A simple dual algorithm for the generalised assignment problem
- The bottleneck generalized assignment problem
- A note on exact algorithms for the bottleneck generalized assignment problem
- Tabu search for the multilevel generalized assignment problem
- Logic cuts for multilevel generalized assignment problems.
- Effective algorithm and heuristic for the generalized assignment problem.
- A class of greedy algorithms for the generalized assignment problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- Formulating and solving production planning problems
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangean relaxation. (With comments and rejoinder).
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Online generalized assignment problem with historical information
- Bees algorithm for generalized assignment problem
- Modeling of financial supply chain
- Preventive maintenance scheduling of power generating units
- A planning and scheduling model for onsertion in printed circuit board assembly
- A branch and efficiency algorithm for the optimal design of supply chain networks
- On a class of assignment problems.
- Minimization of makespan in generalized assignment problem.
- A genetic algorithm for the project assignment problem
- Addressing capacity uncertainty in resource-constrained assignment problems
- Approximate and exact algorithms for the fixed-charge knapsack problem
- An ejection chain approach for the generalized assignment problem
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem
- Optimal ABC inventory classification using interval programming
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- Reducing multivalued discrete variables in solving separable task assignment problems
- Two stage decision making approach for sensor mission assignment problem
- Master surgery scheduling with consideration of multiple downstream units
- A hybrid algorithm for the generalized assignment problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Generalized cover facet inequalities for the generalized assignment problem
- The pure fixed charge transportation problem
- The equilibrium generalized assignment problem and genetic algorithm
- Relaxation techniques applied to some loading problems
- Heuristics for the multi-resource generalized assignment problem
- A GRASP heuristic for slab scheduling at continuous casters
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- A Lagrangean dual-based solution method for a special linear programming problem
- A tabu search heuristic for the generalized assignment problem
- A family of inequalities for the generalized assignment polytope
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
- A Survey of the Generalized Assignment Problem and Its Applications
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- Online multi-dimensional generalized assignment problem with predictions
- An exact method with variable fixing for solving the generalized assignment problem
- An application of semi-Lagrangian relaxation to the generalised assignment problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- Elitist genetic algorithm for assignment problem with imprecise goal
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- The generalized assignment problem: Valid inequalities and facets
- Approximate solutions to large scale capacitated facility location problems
- Goal programming in the context of the assignment problem and a computationally effective solution method
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
This page was built for publication: A branch and bound algorithm for the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066849)