A computational study of exact knapsack separation for the generalized assignment problem
From MaRDI portal
Recommendations
- A cutting plane method for knapsack polytope
- An implementation of exact knapsack separation
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Solving the generalised assignment problem using polyhedral results
- An exact method with variable fixing for solving the generalized assignment problem
Cites work
- scientific article; zbMATH DE number 2089255 (Why is no real title available?)
- scientific article; zbMATH DE number 5158528 (Why is no real title available?)
- scientific article; zbMATH DE number 1263271 (Why is no real title available?)
- (1,k)-configuration facets for the generalized assignment problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A convex-analysis perspective on disjunctive cuts
- A family of inequalities for the generalized assignment polytope
- A genetic algorithm for the generalised assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- Fenchel Cutting Planes for Integer Programs
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- On the Exact Separation of Mixed Integer Knapsack Cuts
- On the facial structure of set packing polyhedra
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Tabu search for the multilevel generalized assignment problem
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The generalized assignment problem: Valid inequalities and facets
Cited in
(19)- A cutting plane method for knapsack polytope
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- On the exact separation of cover inequalities of maximum-depth
- Knapsack polytopes: a survey
- The equilibrium generalized assignment problem and genetic algorithm
- A generic exact solver for vehicle routing and related problems
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
- Strong bounds with cut and column generation for class-teacher timetabling
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- An implementation of exact knapsack separation
- A Lagrangian heuristic for sprint planning in agile software development
- On the exact separation of mixed integer knapsack cuts
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- An exact method with variable fixing for solving the generalized assignment problem
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Convergence of the surrogate Lagrangian relaxation method
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
This page was built for publication: A computational study of exact knapsack separation for the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967219)
